Search: id:A007665
Results 1-1 of 1 results found.

%I A007665 M2414
%S A007665 1,3,5,7,11,15,19,23,27,31,39,47,55,63,71,79,87,95,103,111,127,143,159,
%T A007665 175,191,207,223,239,255,271,287,303,319,335,351,383,415,447,479,511,
%U A007665 543,575,607,639,671,703,735,767,799
%N A007665 Tower of Hanoi with 5 pegs.
%D A007665 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A007665 J.-P. Allouche, Note on the cyclic towers of Hanoi, Theoret. Comput. 
               Sci., 123 (1994), 3-7.
%D A007665 A. Brousseau, Tower of Hanoi with more pegs, J. Recreational Math., 8 
               (1972), 169-176.
%D A007665 D. Wood, Towers of Brahma and Hanoi revisited, J. Recreational Math., 
               14 (1981), 17-24.
%H A007665 S. Alejandre, <a href="http://www.rialto.k12.ca.us/frisbie/mathfair/hanoilegend.html">
               Legend of Towers of Hanoi</a>
%H A007665 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               TowersofHanoi.html">Towers of Hanoi</a>
%F A007665 A007665(n) = - 1 + (1 + A056556(n)*(A056556(n) - 1)/2 + n - A056556(n)*(A056556(n) 
               + 1)*(A056556(n) + 2)/6)*2^A056556(n) - Daniele Parisse (daniele.parisse(AT)m.dasa.de), 
               Feb 06 2001
%o A007665 (PARI) m=1;n=1;while(n<maxn,for(c=1,(m+1)*(m+2)/2, print1(-1+(1+m*(m-1)/
               2+n-m*(m+1)*(m+2)/6)*2^m,",");n++);m++) [From K. Spage (kevspage2001(AT)yahoo.co.uk), 
               Oct 23 2009]
%Y A007665 Cf. A007664, A056556.
%Y A007665 Sequence in context: A076245 A059748 A122124 this_sequence A062488 A116582 
               A052003
%Y A007665 Adjacent sequences: A007662 A007663 A007664 this_sequence A007666 A007667 
               A007668
%K A007665 nonn
%O A007665 1,2
%A A007665 N. J. A. Sloane (njas(AT)research.att.com), Mira Bernstein, Robert G. 
               Wilson v (rgwv(AT)rgwv.com)

Search completed in 0.001 seconds