A119683 - OEIS

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.

1, 4, 12, 34 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,2`
	LINKS	`Table of n, a(n) for n=1..4.`
	CROSSREFS	`Cf. A060843, A028444.` `Sequence in context: A326804 A000754 A317974 * A331834 A135373 A338695` `Adjacent sequences: A119680 A119681 A119682 * A119684 A119685 A119686`
	KEYWORD	`hard,nonn`
	AUTHOR	`Christian Hercher (ch(AT)wurzel.org), Jun 08 2006`
	STATUS	`approved`

Last modified March 28 22:09 EDT 2023. Contains 361596 sequences. (Running on oeis4.)