login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182058 Number of moves needed to solve the Towers of Hanoi puzzle with 6 pegs and n disks. 2
1, 3, 5, 7, 9, 13, 17, 21, 25, 29, 33, 37, 41, 45, 49, 57, 65, 73, 81, 89 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

See A007664 for further references etc.

REFERENCES

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).

LINKS

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

Index entries for sequences related to Towers of Hanoi

CROSSREFS

Cf. A007664 (4 pegs), A007665 (5 pegs).

Sequence in context: A178653 A222314 A228232 * A200975 A058871 A126278

Adjacent sequences:  A182055 A182056 A182057 * A182059 A182060 A182061

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Apr 08 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 18:13 EDT 2021. Contains 343949 sequences. (Running on oeis4.)