A131956 Busy Beaver variation: maximum number of steps 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.

6, 7, 9, 9, 9, 14, 9, 13, 13, 11, 13, 14, 9, 14, 11, 17, 15, 18, 9, 11, 11, 22, 24, 23, 13, 11, 13, 15, 10, 14, 14, 21, 18, 15, 17, 14, 10, 14, 9, 13, 21, 18, 20, 20, 22, 37, 39, 38, 15, 18, 10, 11, 14, 22, 24, 23, 13, 11, 13, 16, 13, 16, 17, 25, 21, 22, 15, 16, 13, 26, 28, 25, 15

Offset: 0

Author

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

Keywords

• nonn

Examples

			a(5) is the maximum number of steps running on a tape which is initialized as:
..000001010000.... with the machine starting at the rightmost 1.
a(5) = 14, with the machine:
A0-> 0*L
A1-> 0BR
B0-> 1BL
B1-> 1AR
		

Links

• Eric Weisstein's World of Mathematics, Busy Beaver.

Crossrefs

Cf. A060843.