|
|
|
|
1, 20, 400, 8000, 160000, 3200000, 64000000, 1280000000, 25600000000, 512000000000, 10240000000000, 204800000000000, 4096000000000000, 81920000000000000, 1638400000000000000, 32768000000000000000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Same as Pisot sequences E(1, 20), L(1, 20), P(1, 20), T(1, 20). Essentially same as Pisot sequences E(20, 400), L(20, 400), P(20, 400), T(20, 400). See A008776 for definitions of Pisot sequences.
The compositions of n in which each natural number is colored by one of p different colors are called p-colored compositions of n. For n >= 1, a(n) equals the number of 20-colored compositions of n such that no adjacent parts have the same color. - Milan Janjic, Nov 17 2011
a(n) gives the number of small cubes in the n-th iteration of the Menger sponge fractal. - Felix Fröhlich, Jul 09 2016
Equivalently, the number of vertices in the n-Menger sponge graph.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: 1/(1-20*x).
E.g.f.: exp(20*x).
a(n) = 20^n.
a(n) = 20*a(n-1) for n > 0, a(0) = 1. (End)
|
|
MAPLE
|
|
|
MATHEMATICA
|
20^Range[0, 10] (* or *) LinearRecurrence[{20}, {1}, 20] (* Eric W. Weisstein, Aug 17 2017 *)
|
|
PROG
|
(Maxima) makelist(20^n, n, 0, 30); /* Martin Ettl, Nov 05 2012 */
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|