Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119683
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1, 4, 12, 34 (list; graph; listen)
OFFSET

1,2
CROSSREFS

Cf. A060843, A028444.

Sequence in context: A027941 A135254 A000754 this_sequence A135373 A094893 A036880

Adjacent sequences: A119680 A119681 A119682 this_sequence A119684 A119685 A119686

KEYWORD

hard,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.