|
|
A001020
|
|
Powers of 11: a(n) = 11^n.
(Formerly M4807 N2054)
|
|
86
|
|
|
1, 11, 121, 1331, 14641, 161051, 1771561, 19487171, 214358881, 2357947691, 25937424601, 285311670611, 3138428376721, 34522712143931, 379749833583241, 4177248169415651, 45949729863572161, 505447028499293771, 5559917313492231481, 61159090448414546291
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Same as Pisot sequences E(1, 11), L(1, 11), P(1, 11), T(1, 11). Essentially same as Pisot sequences E(11, 121), L(11, 121), P(11, 121), T(11, 121). 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 11-colored compositions of n such that no adjacent parts have the same color. - Milan Janjic, Nov 17 2011
a(n), for n <= 4, gives the n-th row of Pascal's triangle (A007318); a(n), n >= 5 "sort of" gives the n-th row of Pascal's triangle, but now the binomial coefficients with more than one digit overlap. - Daniel Forgues, Aug 12 2012
Numbers n such that sigma(11*n) = 11*n + sigma(n). - Jahangeer Kholdi, Nov 13 2013
|
|
REFERENCES
|
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
G.f.: 1/(1-11*x).
E.g.f.: exp(11*x).
|
|
MAPLE
|
|
|
MATHEMATICA
|
|
|
PROG
|
(Maxima) makelist(11*n, n, 0, 20); /* Martin Ettl, Dec 17 2012 */
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|