%I #7 Feb 07 2026 13:04:16
%S 7,1,17,1,9,1,31,1,7,1,21,1,11,1,49,1,7,1,19,1,9,1,37,1,7,1,25,1,13,1,
%T 71,1,7,1,17,1,9,1,35,1,7,1,23,1,11,1,57,1,7,1,21,1,9,1,43,1,7,1,29,1,
%U 15,1,97,1,7,1,17,1,9,1,33,1,7,1,21,1,11,1,55
%N Halting time for Wolfram's 2-state 2-symbol Turing machine 1511 when started with n on the tape.
%C See A392245 for example code.
%H Sean A. Irvine, <a href="/A393209/b393209.txt">Table of n, a(n) for n = 1..1000</a>
%H Stephen Wolfram, <a href="https://writings.stephenwolfram.com/2026/01/p-vs-np-and-the-difficulty-of-computation-a-ruliological-approach/">P vs. NP and the Difficulty of Computation: A Ruliological Approach</a>, 2026.
%t With[{lim = 120}, PacletSymbol["WolframInstitute/TuringMachine", "OneSidedTuringMachineFunction"][{1511, 2, 2}, {1, lim}, lim, "Steps"] ] (* _Michael De Vlieger_, Feb 06 2026, after 5th example in "The Basic Setup" in "P vs. NP ..." *)
%Y Cf. A392245, A393208 (output).
%K nonn
%O 1,1
%A _Sean A. Irvine_, Feb 05 2026