|
|
A011557
|
|
Powers of 10: a(n) = 10^n.
|
|
380
|
|
|
1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000, 10000000000, 100000000000, 1000000000000, 10000000000000, 100000000000000, 1000000000000000, 10000000000000000, 100000000000000000, 1000000000000000000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Same as Pisot sequences E(1, 10), L(1, 10), P(1, 10), T(1, 10). Essentially same as Pisot sequences E(10, 100), L(10, 100), P(10, 100), T(10, 100). 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 10-colored compositions of n such that no adjacent parts have the same color. - Milan Janjic, Nov 17 2011
Smallest n+1 digit number greater than 0 (with offset 0). - Wesley Ivan Hurt, Jan 17 2014
|
|
REFERENCES
|
Philip Morrison et al., Powers of Ten, Scientific American Press, 1982 and later editions.
S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, 10
|
|
FORMULA
|
a(n) = 10^n.
a(n) = 10*a(n-1).
G.f.: 1/(1-10*x).
E.g.f.: exp(10*x).
|
|
MAPLE
|
|
|
MATHEMATICA
|
|
|
PROG
|
(Haskell)
a011557 = (10 ^)
a011557_list = iterate (* 10) 1
(Python)
|
|
CROSSREFS
|
Cf. A178501: this sequence with 0 prefixed.
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Links to "Powers of Ten" books and videos added by N. J. A. Sloane, Nov 07 2009
|
|
STATUS
|
approved
|
|
|
|