A393640 - OEIS

%I #5 Feb 27 2026 15:52:02

%S 7,3,1,17,9,1,11,5,1,13,3,1,31,19,1,21,11,1,9,3,1,23,13,1,15,7,1,7,3,

%T 1,27,15,1,17,5,1,23,3,1,49,33,1,35,21,1,15,3,1,37,23,1,25,13,1,7,3,1,

%U 21,11,1,13,5,1,17,3,1,39,25,1,27,15,1,11,3,1,29

%N Halting time for 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="/A393640/b393640.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. A393639.

%K nonn

%O 1,1

%A _Sean A. Irvine_, Feb 23 2026