A060573 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 0 after n moves.

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, 7, 7, 2, 1, 1, 2, 7, 7, 4, 1, 1, 4, 3, 3, 2, 1, 1, 2, 3, 3, 4, 1, 1, 4, 7, 7, 2, 1, 1, 2, 7, 7, 8, 1, 1, 8, 3, 3, 2, 1, 1, 2, 3, 3, 8, 1, 1, 8, 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

Offset

0,2

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 1,2,3,3,...

Crossrefs

Cf. A060574 (smallest on peg 1), A060575 (smallest on peg 2), A055662 (whole configuration).

Cf. A001511, A060571, A060572.

Sequence in context: A177876 A079633 A285891 * A279086 A337307 A357372

Adjacent sequences: A060570 A060571 A060572 * A060574 A060575 A060576

Keyword

easy,nonn

Author

Henry Bottomley, Apr 03 2001

Status

approved