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

7, 31, 15, 127, 15, 63, 31, 511, 15, 63, 31, 255, 31, 127, 63, 2047, 23, 63, 31, 255, 31, 127, 63, 1023, 31, 127, 63, 511, 63, 255, 127, 8191, 39, 63, 47, 255, 47, 127, 63, 1023, 47, 127, 63, 511, 63, 255, 127, 4095, 55, 127, 63, 511, 63, 255, 127, 2047, 63

Offset

1,1

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"][{3239, 2, 2}, {1, lim}, lim] ] (* Michael De Vlieger, Feb 06 2026, after 3rd example in "The Basic Setup" in "P vs. NP ..." *)

Crossrefs

Cf. A393234 (halting time).

Sequence in context: A221402 A065916 A122654 * A394551 A184121 A167768

Adjacent sequences: A393186 A393187 A393188 * A393190 A393191 A393192

Keyword

nonn

Author

Sean A. Irvine, Feb 04 2026

Status

approved