login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 in binary and 0's everywhere else. The machine is started at the rightmost bit in the number n. 0
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; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..99.

Eric Weisstein's World of Mathematics, Busy Beaver

EXAMPLE

a(5) is the maximum number of 1's on a tape which is initialized as:

..000001010000.... with the machine starting at the rightmost 1.

a(5) = 6, with the machine:

A0-> 1BL

A1-> 1AR

B0-> 1*L

B1-> 1AL

CROSSREFS

Cf. A060843, A131956.

Sequence in context: A073260 A036854 A036858 * A127932 A006075 A241295

Adjacent sequences:  A131954 A131955 A131956 * A131958 A131959 A131960

KEYWORD

nonn

AUTHOR

Bryan Jacobs (bryanjj(AT)gmail.com), Aug 01 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 23 14:29 EDT 2020. Contains 337310 sequences. (Running on oeis4.)