|
| |
| |
|
|
|
1, 33, 1089, 35937, 1185921, 39135393, 1291467969, 42618442977, 1406408618241, 46411484401953, 1531578985264449, 50542106513726817, 1667889514952984961, 55040353993448503713, 1816331681783800622529
(list; graph; refs; listen; history; 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 33-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-33*x). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 24 2008]
a(n)=33^n; a(n)=33*a(n-1) n>0 a(0)=1 [From Vincenzo Librandi, Nov 21 2010]
|
|
|
PROG
| (MAGMA)[33^n: n in [0..100]] [From Vincenzo Librandi, Nov 21 2010]
|
|
|
CROSSREFS
| Sequence in context: A207092 A188989 A189199 * A187539 A130835 A077420
Adjacent sequences: A009974 A009975 A009976 * A009978 A009979 A009980
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
