%I #1 Sep 29 2006 03:00:00
%S 1,4,12,34
%N Maximal number of steps that an n-state Turing machine can make which was started on an initially blank tape before halting on the blank tape again.
%Y Cf. A060843, A028444.
%K hard,nonn
%O 1,2
%A Christian Hercher (ch(AT)wurzel.org), Jun 08 2006