|
Search: id:A015740
|
|
|
| A015740 |
|
Number of 5's in all the partitions of n into distinct parts. |
|
+0
1
|
|
| 0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 3, 4, 4, 6, 8, 9, 11, 14, 16, 19, 23, 27, 32, 38, 45, 53, 62, 72, 84, 97, 112, 130, 150, 172, 199, 228, 260, 298, 340, 386, 440, 500, 566, 642, 727, 820, 926, 1044, 1174, 1321, 1484, 1664, 1866, 2090
(list; graph; listen)
|
|
|
OFFSET
|
1,8
|
|
|
FORMULA
|
G.f.=x^5*product(1+x^j, j=1..infinity)/(1+x^5). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 17 2006
|
|
EXAMPLE
|
a(9)=2 because in the 8 (=A000009(9)) partitions of 9 into distinct parts, namely [9],[8,1],[7,2],[6,3],[6,2,1],[5,4],[5,3,1], and [4,3,2] we have alltogether two parts equal to 5.
|
|
MAPLE
|
g:=x^5*product(1+x^j, j=1..60)/(1+x^5): 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: A130084 A017981 A005863 this_sequence A015750 A084848 A055224
Adjacent sequences: A015737 A015738 A015739 this_sequence A015741 A015742 A015743
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
