%I A060586
%S A060586 0,1,1,3,3,2,3,2,3,7,6,7,6,7,7,5,5,4,7,7,6,5,4,5,6,7,7,15,15,14,13,12,
%T A060586 13,14,15,15,12,13,13,15,15,14,15,14,15,11,10,11,10,11,11,9,9,8,15,14,
%U A060586 15,14,15,15,13,13,12,11,11,10,9,8,9,10,11,11,12,13,13,15,15,14,15,14
%N A060586 Minimum number of moves required to reach position n starting from 0 
               in Tower of Hanoi (with three pegs: 0,1,2), where with position n 
               written in base 3, xyz means smallest disk is on peg z, second smallest 
               is on peg y, third smallest on peg x, etc. and leading zeros indicate 
               largest disks are all on peg 0.
%F A060586 a(n) =A060585(A060583(n)).
%e A060586 a(46)=10 since 46 written in base 3 is 1201 (i.e. with the smallest and 
               fourth smallest disks on the first peg, the third smallest disk on 
               the second peg and the second smallest and any other disks on the 
               zeroth peg) and the optimal moves starting from position 0 go through 
               positions 2, 12, 11, 211, 210, 220, 222, 1222, 1220, 1210 taking 
               ten moves.
%Y A060586 k appears A001316(k) times in the sequence. Cf. A001511, A055661, A055662.
%Y A060586 Sequence in context: A120992 A129979 A075017 this_sequence A076662 A164359 
               A079063
%Y A060586 Adjacent sequences: A060583 A060584 A060585 this_sequence A060587 A060588 
               A060589
%K A060586 base,nice,nonn
%O A060586 0,4
%A A060586 Henry Bottomley (se16(AT)btinternet.com), Apr 04 2001