%I A160002
%S A160002 0,3,10,19,34,57,88,123,176,253,342,449,572,749,980,1261,1560
%N A160002 Number of moves needed to solve 4-peg Tower of Hanoi Puzzle with n disks
%C A160002 Move n disks from the first peg to the last peg. Disks can only move 
               between adjacent pegs in a move.
%H A160002 <a href="http://tieba.baidu.com/f?kz=318545067">A Chinese web page containing 
               the problem and the first 13 terms</a>
%e A160002 For n=2, 10 moves needed:
%e A160002 0: {1,2},{},{},{}
%e A160002 1: {2},{1},{},{}
%e A160002 2: {2},{},{1},{}
%e A160002 3: {2},{},{},{1}
%e A160002 4: {},{2},{},{1}
%e A160002 5: {},{},{2},{1}
%e A160002 6: {},{},{1,2},{}
%e A160002 7: {},{1},{2},{}
%e A160002 8: {},{1},{},{2}
%e A160002 9: {},{},{1},{2}
%e A160002 10: {},{},{},{1,2}
%Y A160002 Cf. A007664. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 30 
               2009]
%Y A160002 Sequence in context: A028878 A010896 A135446 this_sequence A027177 A048343 
               A056789
%Y A160002 Adjacent sequences: A159999 A160000 A160001 this_sequence A160003 A160004 
               A160005
%K A160002 nonn
%O A160002 0,2
%A A160002 Yi Yang (YangYi0526(AT)163.com), Apr 29 2009
%E A160002 Added three more terms Yi Yang (YangYi0526(AT)163.com), Nov 02 2009