A060575 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, 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

Offset

0,3

Links

Table of n, a(n) for n=0..104.

Index entries for sequences related to Towers of Hanoi

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. A060573 (smallest on peg 0), A060574 (smallest on peg 1), A055662 (whole configuration).

Cf. A001511, A060571, A060572.

Sequence in context: A104273 A051778 A057554 * A236074 A099916 A099917

Adjacent sequences: A060572 A060573 A060574 * A060576 A060577 A060578

Keyword

easy,nonn

Author

Henry Bottomley, Apr 03 2001

Status

approved