|
%I #11 Dec 16 2020 06:20:59
%S 1,3,5,7,9,13,17,21,25,29,33,37,41,45,49,57,65,73,81,89
%N Number of moves needed to solve the Towers of Hanoi puzzle with 6 pegs and n disks.
%C See A007664 for further references etc.
%D Paul Cull and E. F. Ecklund, On the Towers of Hanoi and generalized Towers of Hanoi problems. Proceedings of the thirteenth Southeastern conference on combinatorics, graph theory and computing (Boca Raton, Fla., 1982). Congr. Numer. 35 (1982), 229--238. MR0725883(85a:68059).
%H <a href="/index/To#Hanoi">Index entries for sequences related to Towers of Hanoi</a>
%Y Cf. A007664 (4 pegs), A007665 (5 pegs).
%K nonn,more
%O 1,2
%A _N. J. A. Sloane_, Apr 08 2012
|
