login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055662 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. 8
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; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

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 * A041910 A041912 A041914

Adjacent sequences:  A055659 A055660 A055661 * A055663 A055664 A055665

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Jun 06 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 07:42 EST 2012. Contains 205717 sequences.