|
| |
|
|
A096749
|
|
Number of partitions of n into distinct parts, the least being 2.
|
|
2
| |
|
|
0, 0, 1, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 4, 5, 6, 7, 9, 10, 12, 15, 17, 20, 24, 28, 32, 38, 44, 51, 59, 68, 78, 91, 103, 118, 136, 155, 176, 201, 228, 259, 294, 332, 375, 425, 478, 538, 607, 681, 764, 858, 961, 1075, 1203, 1343, 1499, 1673, 1863, 2073, 2308, 2564, 2847, 3161, 3504
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,10
|
|
|
COMMENTS
| The old entry with this sequence number was a duplicate of A071569.
|
|
|
FORMULA
| a(n)=A025148(n-2), n>2. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008
G.f.: x^2*product_{j=3..infinity} (1+x^j). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008
a(n)=A025148(n-2), n>1. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 30 2008]
|
|
|
CROSSREFS
| Cf. A025147.
Cf. A025147.
Sequence in context: A185227 A026823 A025148 * A036821 A026798 A185325
Adjacent sequences: A096746 A096747 A096748 * A096750 A096751 A096752
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Sep 28 2008
|
| |
|
|
