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

0, 0, 2, 4, 4, 0, 6, 8, 8, 8, 10, 12, 12, 0, 14, 16, 16, 16, 18, 20, 20, 16, 22, 24, 24, 24, 26, 28, 28, 0, 30, 32, 32, 32, 34, 36, 36, 32, 38, 40, 40, 40, 42, 44, 44, 32, 46, 48, 48, 48, 50, 52, 52, 48, 54, 56, 56, 56, 58, 60, 60, 0, 62, 64, 64, 64, 66, 68

Offset

1,3

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"][{2977, 2, 2}, {1, lim}, lim] ] (* Michael De Vlieger, Feb 10 2026, after 3rd example in the Wolfram link *)

Crossrefs

Cf. A393211 (similar function), A393208 (halting time).

Sequence in context: A352452 A195479 A393211 * A112793 A372037 A009116

Adjacent sequences: A393304 A393305 A393306 * A393308 A393309 A393310

Keyword

nonn

Author

Sean A. Irvine, Feb 10 2026

Status

approved