

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, 262149, 524293, 1048581, 2097157, 4194309, 8388613, 16777221, 33554437, 67108869, 134217733, 268435461, 536870917, 1073741829, 2147483653, 4294967301, 8589934597
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


LINKS

Table of n, a(n) for n=1..35.
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^(n2) for n>3.


MATHEMATICA

LinearRecurrence[{3, 2}, {1, 3, 5, 9, 13}, 40] (* Harvey P. Dale, May 10 2019 *)


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


EXTENSIONS

More terms from Harvey P. Dale, May 10 2019


STATUS

approved



