Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #10 Mar 05 2023 13:25:08
%S 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,
%T 11,13,15,10,14,14,21,18,15,17,14,10,14,9,13,21,18,20,20,22,37,39,38,
%U 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
%N 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.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/BusyBeaver.html">Busy Beaver</a>.
%e a(5) is the maximum number of steps running on a tape which is initialized as:
%e ..000001010000.... with the machine starting at the rightmost 1.
%e a(5) = 14, with the machine:
%e A0-> 0*L
%e A1-> 0BR
%e B0-> 1BL
%e B1-> 1AR
%Y Cf. A060843.
%K nonn
%O 0,1
%A Bryan Jacobs (bryanjj(AT)gmail.com), Aug 01 2007