

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



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
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


LINKS

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


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



