A210243 Hanoi solutions (odd), the disks are moved from pillar 1 to pillar 3. For disks = 2k+1 use the first 2^(2k+2)-2 number pairs.

1, 3, 1, 2, 3, 2, 1, 3, 2, 1, 2, 3, 1, 3, 1, 2, 3, 2, 3, 1, 2, 1, 3, 2, 1, 3, 1, 2, 3, 2, 1, 3, 2, 1, 2, 3, 1, 3, 2, 1, 3, 2, 3, 1, 2, 1, 2, 3, 1, 3, 1, 2, 3, 2, 1, 3, 2, 1, 2, 3, 1, 3, 1, 2, 3, 2, 3, 1, 2, 1, 3, 2, 1, 3, 1, 2, 3, 2, 3, 1, 2, 1, 2, 3, 1, 3, 2

Offset

1,2

Links

Table of n, a(n) for n=1..87.

Index entries for sequences related to Towers of Hanoi

Example

The solution to Hanoi with 3 disks from pillar 1 to pillar 3 is (1,3), (1,2), (3,2), (1,3), (2,1), (2,3), (1,3).

Crossrefs

If the number of disks is even see A101608.

Sequence in context: A100337 A036584 A260453 * A232269 A305391 A165084

Adjacent sequences: A210240 A210241 A210242 * A210244 A210245 A210246

Keyword

nonn,easy

Author

Y. Z. Chen, Mar 24 2012

Status

approved