id:A060575 - OEIS Search Results

Search: id:A060575

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 2 after n moves (or 0 if there are no disks on peg 2).

+0
5

0, 0, 2, 1, 1, 2, 0, 0, 4, 1, 1, 4, 3, 3, 2, 1, 1, 2, 3, 3, 4, 1, 1, 4, 0, 0, 2, 1, 1, 2, 0, 0, 6, 1, 1, 6, 3, 3, 2, 1, 1, 2, 3, 3, 6, 1, 1, 6, 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, 5, 2, 1, 1, 2, 5, 5, 6, 1, 1, 6, 3, 3, 2, 1, 1, 2, 3, 3, 6, 1, 1, 6, 0, 0, 2, 1, 1, 2, 0, 0, 4 (list; graph; listen)

	OFFSET	`0,3`
	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 0,0,2,1,...`
	CROSSREFS	`Cf. A001511, A055662, A060571, A060572, A060573, A060574, A060575.` `Adjacent sequences: A060572 A060573 A060574 this_sequence A060576 A060577 A060578` `Sequence in context: A104273 A051778 A057554 this_sequence A099916 A099917 A137412`
	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