id:A055662 - OEIS Search Results

Search: id:A055662

Displaying 1-1 of 1 results found.

page 1

Successive positions in Tower of Hanoi (with three pegs {0,1,2}) where xyz means smallest disk is on peg z, second smallest is on peg y, third smallest on peg x, etc. and leading zeros indicate largest disks are all on peg 0.

+0
9

0, 1, 21, 22, 122, 120, 110, 111, 2111, 2112, 2102, 2100, 2200, 2201, 2221, 2222, 12222, 12220, 12210, 12211, 12011, 12012, 12002, 12000, 11000, 11001, 11021, 11022, 11122, 11120, 11110, 11111, 211111, 211112, 211102, 211100, 211200 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`Optimal for moving an even number of disks from peg 0 to peg 2 or an odd number from peg 0 to peg 1`
	FORMULA	`a(n) =sum( 10^j * ((floor[(n/2^j+1)/2]*(-1)^j mod 3) ) with j=0 to floor[log2(n)]`
	CROSSREFS	`Cf. A001511, A055661.` `Sequence in context: A041906 A041904 A041908 this_sequence A041910 A041912 A041914` `Adjacent sequences: A055659 A055660 A055661 this_sequence A055663 A055664 A055665`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jun 06 2000`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research