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.

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

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: A350459 A036854 A036858 * A342348 A127932 A006075

Adjacent sequences: A131954 A131955 A131956 * A131958 A131959 A131960

Keyword

nonn

Author

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

Status

approved