id:A060573 - OEIS Search Results

Search: id:A060573

Displaying 1-1 of 1 results found.

page 1

Tower of Hanoi: using the optimal way to move an even number of disks from peg 0 to peg 2 or an odd number from peg 0 to peg 1, a(n) is the smallest disk on peg 0 after n moves.

+0
5

1, 2, 3, 3, 4, 1, 1, 4, 5, 5, 2, 1, 1, 2, 5, 5, 6, 1, 1, 6, 3, 3, 2, 1, 1, 2, 3, 3, 6, 1, 1, 6, 7, 7, 2, 1, 1, 2, 7, 7, 4, 1, 1, 4, 3, 3, 2, 1, 1, 2, 3, 3, 4, 1, 1, 4, 7, 7, 2, 1, 1, 2, 7, 7, 8, 1, 1, 8, 3, 3, 2, 1, 1, 2, 3, 3, 8, 1, 1, 8, 5, 5, 2, 1, 1, 2, 5, 5, 4, 1, 1, 4, 3, 3, 2, 1, 1, 2, 3, 3, 4, 1, 1, 4, 5 (list; graph; listen)

	OFFSET	`0,2`
	EXAMPLE	`Start by moving first disk from peg 0 to peg 1, second disk from peg 0 to peg 2, first disk from peg 1 to peg 2, etc. so sequence starts 1,2,3,3,...`
	CROSSREFS	`Cf. A001511, A055662, A060571, A060572, A060573, A060574, A060575.` `Adjacent sequences: A060570 A060571 A060572 this_sequence A060574 A060575 A060576` `Sequence in context: A010120 A012887 A079633 this_sequence A103893 A106448 A098007`
	KEYWORD	`easy,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Apr 03 2001`

page 1

Search completed in 0.002 seconds

Last modified May 15 13:16 EDT 2008. Contains 139641 sequences.

AT&T Labs Research