|
Search: id:A015743
|
|
|
| A015743 |
|
Number of 8's in all the partitions of n into distinct parts. |
|
+0
1
|
|
| 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 2, 3, 4, 5, 5, 7, 9, 10, 13, 15, 18, 22, 27, 31, 37, 44, 51, 61, 71, 82, 95, 111, 128, 148, 171, 195, 225, 258, 295, 337, 384, 437, 497, 565, 639, 724, 818, 923, 1042, 1173, 1319, 1483, 1665
(list; graph; listen)
|
|
|
OFFSET
|
1,11
|
|
|
FORMULA
|
G.f.=x^8*product(1+x^j, j=1..infinity)/(1+x^8). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 17 2006
|
|
EXAMPLE
|
a(11)=2 because in the 12 (=A000009(11)) partitions of 11 into distinct parts, namely [11],[10,1],[9,2],[8,3],[8,2,1],[7,4],[7,3,1],[6,5],[6,4,1],[6,3,2],[5,4,2], and [5,3,2,1], we have alltogether two parts equal to 8.
|
|
MAPLE
|
g:=x^8*product(1+x^j, j=1..60)/(1+x^8): gser:=series(g, x=0, 57): seq(coeff(gser, x, n), n=1..54); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 17 2006
|
|
CROSSREFS
|
Sequence in context: A011884 A029070 A112341 this_sequence A015755 A096443 A126442
Adjacent sequences: A015740 A015741 A015742 this_sequence A015744 A015745 A015746
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
