login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060571 Tower of Hanoi: 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 is on move n to move disk A001511 from peg A060571 (here) to peg A060572. 5
0, 0, 1, 0, 2, 2, 0, 0, 1, 1, 2, 1, 0, 0, 1, 0, 2, 2, 0, 2, 1, 1, 2, 2, 0, 0, 1, 0, 2, 2, 0, 0, 1, 1, 2, 1, 0, 0, 1, 1, 2, 2, 0, 2, 1, 1, 2, 1, 0, 0, 1, 0, 2, 2, 0, 0, 1, 1, 2, 1, 0, 0, 1, 0, 2, 2, 0, 2, 1, 1, 2, 2, 0, 0, 1, 0, 2, 2, 0, 2, 1, 1, 2, 1, 0, 0, 1, 1, 2, 2, 0, 2, 1, 1, 2, 2, 0, 0, 1, 0, 2, 2, 0, 0, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
a(n) is equal to a(2n) with the 1's and 2s reversed, thus a(n) = a(4n). - Donald Sampson (marsquo(AT)hotmail.com), Dec 01 2003
LINKS
J.-P. Allouche, D. Astoorian, J. Randall, and J. Shallit, Morphisms, squarefree strings, and the Tower of Hanoi puzzle, Amer. Math. Monthly 101 (1994), 651-658.
FORMULA
If n>2^A001511(n) then a(n)=a(n-2^A001511(n))-(-1)^A001511(n) mod 3 =A060572(n-2^A001511(n)), otherwise a(k)=0. Also A001511(n)-th digit from right of A055662(n-1).
EXAMPLE
Start by moving first disk from peg 0 (to peg 1), second disk from peg 0 (to peg 2), first disk form peg 1 (to peg 2), etc. so sequence starts 0,0,1,...
CROSSREFS
Sequence in context: A295335 A227838 A050605 * A131555 A293209 A318753
KEYWORD
easy,nonn
AUTHOR
Henry Bottomley, Apr 03 2001
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 5 02:31 EST 2024. Contains 370537 sequences. (Running on oeis4.)