login
This site is supported by donations 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; internal format)
OFFSET

1,2

CROSSREFS

Cf. A060843, A028444.

Sequence in context: A027941 A135254 A000754 * A135373 A094893 A036880

Adjacent sequences:  A119680 A119681 A119682 * A119684 A119685 A119686

KEYWORD

hard,nonn

AUTHOR

Christian Hercher (ch(AT)wurzel.org), Jun 08 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 19:13 EST 2012. Contains 206085 sequences.