|
|
A226511
|
|
a(n) = 3*(5^n-3^n)/2.
|
|
2
|
|
|
0, 3, 24, 147, 816, 4323, 22344, 113907, 576096, 2900163, 14559864, 72976467, 365413776, 1828663203, 9148098984, 45754843827, 228817265856, 1144215469443, 5721464767704, 28608486099987, 143045917284336, 715240046774883, 3576231614934024, 17881252217848947, 89406543518781216
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
Max A. Alekseyev and T. Berger, Solving the Tower of Hanoi with Random Moves. In: J. Beineke, J. Rosenhouse (eds.) The Mathematics of Various Entertaining Subjects: Research in Recreational Math, Princeton University Press, 2016, pp. 65-79. ISBN 978-0-691-16403-8
|
|
FORMULA
|
|
|
MATHEMATICA
|
CoefficientList[Series[3 x / ((1 - 5 x) (1 - 3 x)), {x, 0, 30}], x] (* Vincenzo Librandi, Jun 12 2013 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|