close
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119683
Maximal number of steps that an n-state Turing machine can make which was started on an initially blank tape before halting on the blank tape again.
0
1, 4, 12, 34, 187
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Table of n, a(n) for n=1..5.
Christian Hercher, Castor Ministerialis, arXiv:2510.17438 [cs.FL], 2025. See p. 9.
CROSSREFS
Cf. A060843, A028444.
Sequence in context: A061703 A126948 A131593 * A340492 A084362 A318941
Adjacent sequences: A119680 A119681 A119682 * A119684 A119685 A119686
KEYWORD
hard,nonn
AUTHOR
Christian Hercher (ch(AT)wurzel.org), Jun 08 2006
EXTENSIONS
a(5) from Hercher, entered by Michael De Vlieger, Oct 24 2025
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified May 21 18:11 EDT 2026. Contains 395802 sequences.
License Agreements, Terms of Use, Privacy Policy