Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
integer sequence
|
| gptkbp:author |
gptkb:N._J._A._Sloane
|
| gptkbp:citation |
gptkb:OEIS_A000009
gptkb:OEIS_A001047 OEIS A000041 |
| gptkbp:describes |
Counts the number of ways n can be written as a sum of distinct positive integers.
|
| gptkbp:first_terms |
1,1,1,2,2,3,4,5,7,8,10,12,15,18,22,27,32,38,46,54,64,76,89,104,122,142,165,192,222,256,296,340,391,448,513,585,668,760,864,980,1111,1256,1420,1602,1808,2036,2290,2572,2884,3230
|
| gptkbp:form |
Generating function: Product_{k>=1} (1 + x^k)
|
| gptkbp:hasKeyword |
easy
nice nonn |
| gptkbp:hasOEISId |
A008836
|
| gptkbp:hasOnlineEntry |
https://oeis.org/A008836
|
| https://www.w3.org/2000/01/rdf-schema#label |
OEIS A008836
|
| gptkbp:OEIS |
yes
|
| gptkbp:offset |
0,4
|
| gptkbp:sequence |
Number of partitions of n into distinct parts
partition sequence |
| gptkbp:bfsParent |
gptkb:Liouville_function
|
| gptkbp:bfsLayer |
6
|