A393639 Number computed by Wolfram's 1-state 3-symbol Turing machine 29 when started with n on the tape.

26, 8, 5, 242, 80, 8, 80, 26, 11, 242, 17, 14, 2186, 728, 17, 728, 242, 20, 80, 26, 23, 728, 242, 26, 242, 80, 29, 53, 35, 32, 2186, 728, 35, 728, 53, 38, 2186, 44, 41, 19682, 6560, 44, 6560, 2186, 47, 728, 53, 50, 6560, 2186, 53, 2186, 728, 56, 80, 62, 59

Offset

1,1

Comments

All numbers on the tape are interpreted as ternary.

This machine has asymptotic quadratic runtime.

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.

Crossrefs

Cf. A393640, A392245.

Sequence in context: A040656 A070661 A040655 * A163987 A163989 A034077

Adjacent sequences: A393636 A393637 A393638 * A393640 A393641 A393642

Keyword

nonn

Author

Sean A. Irvine, Feb 23 2026

Status

approved