Statements (79)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
integer sequence
|
| gptkbp:author |
gptkb:N._J._A._Sloane
|
| gptkbp:citation |
OEIS:A000009
OEIS:A001047 OEIS:A001970 OEIS:A025147 OEIS:A036469 OEIS:A036470 OEIS:A036471 OEIS:A036472 OEIS:A036473 OEIS:A036474 OEIS:A036475 OEIS:A036476 OEIS:A036477 OEIS:A036478 OEIS:A036479 OEIS:A036480 OEIS:A036481 OEIS:A036482 OEIS:A036483 OEIS:A036484 OEIS:A036485 OEIS:A036486 OEIS:A036487 OEIS:A036488 OEIS:A036489 OEIS:A036490 OEIS:A036491 OEIS:A036492 OEIS:A036493 OEIS:A036494 OEIS:A036495 OEIS:A036496 OEIS:A036497 OEIS:A036498 OEIS:A036499 OEIS:A036500 OEIS:A036501 OEIS:A036502 OEIS:A036503 OEIS:A036504 OEIS:A036505 OEIS:A036506 OEIS:A036507 OEIS:A036508 OEIS:A036509 OEIS:A036510 OEIS:A036511 |
| gptkbp:form |
a(n) = number of partitions of n into distinct parts = number of partitions of n into odd parts.
|
| gptkbp:hasGeneratingFunction |
Product_{k>=1} (1 + x^k) = Product_{k>=1} 1/(1 - x^{2k-1})
|
| gptkbp:hasKeyword |
easy
nice core full nonn fini |
| gptkbp:hasOEISTitle |
Number of partitions of n into distinct parts (or number of partitions into odd parts).
|
| gptkbp:hasOffset |
0
|
| https://www.w3.org/2000/01/rdf-schema#label |
OEIS:A008908
|
| gptkbp:OEISID |
gptkb:A008908
|
| gptkbp:OEISURL |
https://oeis.org/A008908
|
| gptkbp:referencedIn |
L. Comtet, Advanced Combinatorics, Reidel, 1974.
I. G. Macdonald, Symmetric Functions and Hall Polynomials, Oxford, 1979. G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976. |
| gptkbp:sequence |
2
1 10 12 15 18 22 27 3 5 7 8 |
| gptkbp:bfsParent |
gptkb:3x+1_problem
|
| gptkbp:bfsLayer |
8
|