login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A248604 Numbers a(n) which are the minimum number of moves needed in a variation of the tower of Hanoi with 4 towers and n disks. 0
1, 3, 5, 9, 13, 21, 37, 69, 133, 261, 517, 1029, 2053, 4101, 8197, 16389, 32773, 65541, 131077 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Index entries for linear recurrences with constant coefficients, signature (3,-2).

FORMULA

a(1)=1; a(2)=3; a(3)=5; a(n) = 5+2^(n-2) for n>3.

CROSSREFS

Cf. A168614.

Sequence in context: A136252 A187212 A141325 * A146905 A052282 A001993

Adjacent sequences:  A248601 A248602 A248603 * A248605 A248606 A248607

KEYWORD

nonn,easy

AUTHOR

Aaron C. Horak, Oct 09 2014

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified October 20 05:42 EDT 2017. Contains 293601 sequences.