login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
CROSSREFS
Sequence in context: A326804 A000754 A317974 * A331834 A135373 A338695
KEYWORD
hard,nonn
AUTHOR
Christian Hercher (ch(AT)wurzel.org), Jun 08 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 1 07:53 EST 2024. Contains 370430 sequences. (Running on oeis4.)