|
%I #16 Jan 20 2021 03:33:35
%S 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,
%T 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,
%U 2,1,3,2,1,3,1,2,3,2,3,1,2,1,2,3,1,3,2
%N 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.
%H <a href="/index/To#Hanoi">Index entries for sequences related to Towers of Hanoi</a>
%e 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).
%Y If the number of disks is even see A101608.
%K nonn,easy
%O 1,2
%A _Y. Z. Chen_, Mar 24 2012
|
