%I A131957
%S A131957 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,
%T A131957 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,
%U A131957 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
%N 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.
%H A131957 <a href="http://mathworld.wolfram.com/BusyBeaver.html">http://mathworld.wolfram.com/
               BusyBeaver.html</a>
%e A131957 a(5) is the maximum number of 1's on a tape which is initialized as:
%e A131957 ..000001010000.... with the machine starting at the right-most 1.
%e A131957 a(5) = 6, with the machine:
%e A131957 A0-> 1BL
%e A131957 A1-> 1AR
%e A131957 B0-> 1*L
%e A131957 B1-> 1AL
%Y A131957 Cf. A060843, A131956.
%Y A131957 Sequence in context: A073260 A036854 A036858 this_sequence A127932 A006075 
               A074904
%Y A131957 Adjacent sequences: A131954 A131955 A131956 this_sequence A131958 A131959 
               A131960
%K A131957 nonn
%O A131957 0,1
%A A131957 Bryan Jacobs (bryanjj(AT)gmail.com), Aug 01 2007