|
| |
| |
|
|
|
1, 39, 1521, 59319, 2313441, 90224199, 3518743761, 137231006679, 5352009260481, 208728361158759, 8140406085191601, 317475837322472439, 12381557655576425121, 482880748567480579719, 18832349194131742609041
(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 39-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
Index to sequences with linear recurrences with constant coefficients, signature (39).
|
|
|
FORMULA
|
G.f.: 1/(1-39*x). [From Philippe DELEHAM, Nov 24 2008]
a(n)=39^n; a(n)=39*a(n-1) a(0)=1 [From Vincenzo Librandi, Nov 21 2010]
|
|
|
MATHEMATICA
|
39^Range[0, 20] (* Harvey P. Dale, Dec 02 2010 *)
|
|
|
PROG
|
(MAGMA)[39^n: n in [0..20]] [From Vincenzo Librandi, Nov 21 2010]
(PARI) a(n)=39^n \\ Charles R Greathouse IV, Nov 18 2011
|
|
|
CROSSREFS
|
Sequence in context: A170758 A218741 A112617 * A158768 A139191 A176073
Adjacent sequences: A009980 A009981 A009982 * A009984 A009985 A009986
|
|
|
KEYWORD
|
nonn,easy,changed
|
|
|
AUTHOR
|
N. J. A. Sloane.
|
|
|
STATUS
|
approved
|
| |
|
|
