A393208 Number computed by Wolfram's 2-state 2-symbol Turing machine 1511 when started with n on the tape.

7, 3, 31, 5, 15, 7, 127, 9, 15, 11, 63, 13, 31, 15, 511, 17, 23, 19, 63, 21, 31, 23, 255, 25, 31, 27, 127, 29, 63, 31, 2047, 33, 39, 35, 63, 37, 47, 39, 255, 41, 47, 43, 127, 45, 63, 47, 1023, 49, 55, 51, 127, 53, 63, 55, 511, 57, 63, 59, 255, 61, 127, 63

Offset

1,1

Comments

See A392245 for example code.

Also computed by 352 different 3-state 2-symbol machines, including machine number 1069163.

Links

Sean A. Irvine, Table of n, a(n) for n = 1..1000

Stephen Wolfram, P vs. NP and the Difficulty of Computation: A Ruliological Approach, 2026.

Mathematica

With[{lim = 120}, PacletSymbol["WolframInstitute/TuringMachine", "OneSidedTuringMachineFunction"][{1511, 2, 2}, {1, lim}, lim] ] (* Michael De Vlieger, Feb 06 2026, after 3rd example in "The Basic Setup" in "P vs. NP ..." *)

Crossrefs

Cf. A392245, A393209 (halting time).

Sequence in context: A368350 A253892 A116419 * A290235 A225825 A199927

Adjacent sequences: A393205 A393206 A393207 * A393209 A393210 A393211

Keyword

nonn

Author

Sean A. Irvine, Feb 05 2026

Status

approved