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

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

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 = 10000}, PacletSymbol["WolframInstitute/TuringMachine", "OneSidedTuringMachineFunction"][{3555, 2, 2}, {1, lim}, lim] ] (* Michael De Vlieger, Feb 10 2026, after 3rd example in the Wolfram link *)

Crossrefs

Cf. A393305.

Sequence in context: A391205 A389106 A256527 * A040219 A317315 A330361

Adjacent sequences: A393301 A393302 A393303 * A393305 A393306 A393307

Keyword

nonn

Author

Sean A. Irvine, Feb 10 2026

Status

approved