A393639 - OEIS

%I #7 Feb 27 2026 15:51:59

%S 26,8,5,242,80,8,80,26,11,242,17,14,2186,728,17,728,242,20,80,26,23,

%T 728,242,26,242,80,29,53,35,32,2186,728,35,728,53,38,2186,44,41,19682,

%U 6560,44,6560,2186,47,728,53,50,6560,2186,53,2186,728,56,80,62,59

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

%C All numbers on the tape are interpreted as ternary.

%C This machine has asymptotic quadratic runtime.

%H Sean A. Irvine, <a href="/A393639/b393639.txt">Table of n, a(n) for n = 1..1000</a>

%H Stephen Wolfram, <a href="https://writings.stephenwolfram.com/2026/01/p-vs-np-and-the-difficulty-of-computation-a-ruliological-approach/">P vs. NP and the Difficulty of Computation: A Ruliological Approach</a>, 2026.

%Y Cf. A393640, A392245.

%K nonn

%O 1,1

%A _Sean A. Irvine_, Feb 23 2026