|
%I #7 Jan 22 2021 20:30:22
%S 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,
%T 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,
%U 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
%N 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).
%H <a href="/index/To#Hanoi">Index entries for sequences related to Towers of Hanoi</a>
%e 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,...
%Y Cf. A060573 (smallest on peg 0), A060574 (smallest on peg 1), A055662 (whole configuration).
%Y Cf. A001511, A060571, A060572.
%K easy,nonn
%O 0,3
%A _Henry Bottomley_, Apr 03 2001
|
