login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007665 Tower of Hanoi with 5 pegs.
(Formerly M2414)
5
1, 3, 5, 7, 11, 15, 19, 23, 27, 31, 39, 47, 55, 63, 71, 79, 87, 95, 103, 111, 127, 143, 159, 175, 191, 207, 223, 239, 255, 271, 287, 303, 319, 335, 351, 383, 415, 447, 479, 511, 543, 575, 607, 639, 671, 703, 735, 767, 799 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

A. Brousseau, Tower of Hanoi with more pegs, J. Recreational Math., 8 (1975-1976), 169-176.

Cull, Paul; Ecklund, E. F. 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). - N. J. A. Sloane, Apr 08 2012

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

D. Wood, Towers of Brahma and Hanoi revisited, J. Recreational Math., 14 (1981), 17-24.

LINKS

Table of n, a(n) for n=1..49.

S. Alejandre, Legend of Towers of Hanoi

J.-P. Allouche, Note on the cyclic towers of Hanoi, Theoret. Comput. Sci., 123 (1994), 3-7.

A. Brousseau, Tower of Hanoi with more pegs, J. Recreational Math 8.3 (1975-6), 169-176. (Annotated scanned copy)

Eric Weisstein's World of Mathematics, Towers of Hanoi

Index entries for sequences related to Towers of Hanoi

FORMULA

a(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

MATHEMATICA

terms = 100;

A056556 = Table[Table[m, {(m+1)(m+2)/2}], {m, 0, (6 terms)^(1/3) // Ceiling}] // Flatten;

a[n_] := With[{t = A056556[[n+1]]}, -1+(1+t(t-1)/2+n-t(t+1)(t+2)/6)*2^t];

Array[a, terms] (* Jean-François Alcover, Feb 28 2019 *)

PROG

(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++) \\ K. Spage, Oct 23 2009]

CROSSREFS

Cf. A007664. A182058, A056556.

Sequence in context: A122124 A219655 A335039 * A208994 A194602 A337217

Adjacent sequences: A007662 A007663 A007664 * A007666 A007667 A007668

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Mira Bernstein, Robert G. Wilson v

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 21:00 EST 2022. Contains 358648 sequences. (Running on oeis4.)