Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131957
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131957 Busy Beaver sigma variation: maximum number of 1's on the final tape, for a 2-state, 2-symbol Turing machine running on a tape which is initialized with the number n and 0's everywhere else. The machine is started at the right-most digit in the number n. +0
1
4, 4, 4, 5, 6, 6, 5, 6, 5, 6, 6, 7, 6, 7, 6, 7, 6, 7, 6, 6, 8, 8, 7, 8, 6, 7, 7, 8, 7, 8, 7, 8, 7, 8, 6, 8, 7, 7, 7, 7, 6, 8, 8, 9, 8, 9, 8, 10, 7, 8, 7, 7, 7, 9, 8, 9, 7, 8, 8, 9, 8, 9, 8, 9, 8, 9, 8, 8, 8, 7, 8, 10, 8, 7, 7, 8, 8, 8, 7, 8, 8, 8, 7, 10, 10, 10, 9, 10, 8, 10, 10, 10, 10, 10, 9, 12, 8, 9, 7, 9 (list; graph; listen)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research