|
| |
|
|
A029220
|
|
Expansion of 1/((1-x^2)*(1-x^6)*(1-x^8)*(1-x^11)).
|
|
1
|
|
|
|
1, 0, 1, 0, 1, 0, 2, 0, 3, 0, 3, 1, 4, 1, 5, 1, 6, 2, 7, 3, 8, 3, 10, 4, 12, 5, 13, 6, 15, 7, 18, 8, 20, 10, 22, 12, 25, 13, 28, 15, 31, 18, 34, 20, 38, 22, 42, 25, 46, 28, 50, 31, 55, 34, 60, 38, 65, 42, 70, 46, 76, 50, 82, 55, 88, 60, 95, 65, 102, 70
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,7
|
|
|
COMMENTS
|
Gives the number of ways one can write n as the sum of the numbers 2, 6, 8 and 11 if the order of the summands is irrelevant. - Stefan Steinerberger, Apr 09 2006
In other words, number of partitions of n into parts 2, 6, 8, and 11. - Joerg Arndt, Jun 02 2014
|
|
|
LINKS
|
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (0,1,0,0,0,1,0,0,0,-1,1,0,-1,-1,0,1,-1,0,0,0,1,0,0,0,1,0,-1).
|
|
|
MATHEMATICA
|
CoefficientList[Series[1/((1-x^2)(1-x^6)(1-x^8)(1-x^11)), {x, 0, 100}], x] (* Stefan Steinerberger, Apr 09 2006 *)
|
|
|
PROG
|
(PARI) Vec(1/((1-x^2)*(1-x^6)*(1-x^8)*(1-x^11)) + O(x^80)) \\ Jinyuan Wang, Mar 15 2020
|
|
|
CROSSREFS
|
Sequence in context: A265017 A035376 A259708 * A249901 A253274 A337980
Adjacent sequences: A029217 A029218 A029219 * A029221 A029222 A029223
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
N. J. A. Sloane
|
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger, Apr 09 2006
|
|
|
STATUS
|
approved
|
| |
|
|
