|
Search: id:A025150
|
|
|
| A025150 |
|
Number of partitions of n into distinct parts >= 5. |
|
+0
3
|
|
| 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 6, 7, 8, 10, 11, 13, 15, 17, 20, 23, 26, 30, 35, 39, 45, 51, 58, 66, 75, 84, 96, 108, 122, 137, 155, 173, 195, 219, 245, 274, 307, 342, 383, 427, 475, 529, 589, 654, 727, 807, 894, 991, 1098, 1214, 1343, 1485, 1638, 1809, 1995
(list; graph; listen)
|
|
|
OFFSET
|
0,12
|
|
|
FORMULA
|
G.f.=product(1+x^j, j=5..infinity)-1. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 17 2006
a(n)=A026825(n+4). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008
G.f.: product_{j=5..infinity} (1+x^j). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008
|
|
EXAMPLE
|
a(12)=2 because we have [12] and [7,5].
|
|
MAPLE
|
g:=product(1+x^j, j=5..70)-1: gser:=series(g, x=0, 60): seq(coeff(gser, x, n), n=1..53); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 17 2006
|
|
CROSSREFS
|
Cf. A025147.
Cf. A025147.
Sequence in context: A025157 A006141 A026825 this_sequence A026800 A029028 A029072
Adjacent sequences: A025147 A025148 A025149 this_sequence A025151 A025152 A025153
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
