|
| |
| |
|
|
|
1, 31, 961, 29791, 923521, 28629151, 887503681, 27512614111, 852891037441, 26439622160671, 819628286980801, 25408476896404831, 787662783788549761, 24417546297445042591, 756943935220796320321, 23465261991844685929951
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
COMMENTS
|
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 31-colored compositions of n such that no adjacent parts have the same color. - Milan Janjic, Nov 17 2011
|
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..100
Tanya Khovanova, Recursive Sequences
|
|
|
FORMULA
|
G.f.: 1/(1-31*x). [From Philippe DELEHAM, Nov 24 2008]
E.g.f.:exp(31x) [From Geoffrey Critzer, Feb 28 2009]
a(n) = 31*a(n-1) . [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 29 2009]
|
|
|
PROG
|
(Sage) [lucas_number1(n, 31, 0) for n in xrange(1, 17)]# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 29 2009]
|
|
|
CROSSREFS
|
Sequence in context: A207431 A208373 A171305 * A042862 A159674 A138958
Adjacent sequences: A009972 A009973 A009974 * A009976 A009977 A009978
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
N. J. A. Sloane.
|
|
|
STATUS
|
approved
|
| |
|
|
