|
| |
|
|
A165190
|
|
G.f.: 1/((1-x^4)*(1-x^5)).
|
|
0
| |
|
|
1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 3, 3, 2, 2, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 4, 4, 3, 3, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 4, 4, 4, 5, 5, 4, 4, 5, 5, 5, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 5, 5, 5, 6
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,21
|
|
|
COMMENTS
| A121262 convolved with A079998. The two sequences have very simple generating functions and can be
mapped to the numeric partitions 4=4 and 5=5 respectively.
|
|
|
LINKS
| Index to Molien series
|
|
|
FORMULA
| 1 followed by the Euler transform of the finite sequence 0,0,0,1,1.
G.f.: 1/((1-x)^2*(1+x)*(1+x^2)*(1+x+x^2+x^3+x^4)). [R. J. Mathar, Oct 07 2009]
a(n) = A117444(n+2)/5 + n/20 +9/40 +(-1)^n/8 +A057077(n)/4. [R. J. Mathar, Oct 07 2009]
|
|
|
CROSSREFS
| Sequence in context: A050377 A001826 A003641 * A025890 A043277 A170979
Adjacent sequences: A165187 A165188 A165189 * A165191 A165192 A165193
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Alford Arnold (Alford1940(AT)aol.com), Sep 24 2009
|
|
|
EXTENSIONS
| Removed duplicate of comment in A165188; Euler Xfm formula corrected - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 07 2009
|
| |
|
|
