Recurrences for the partition function and its relatives (Q1880824): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60059729, #quickstatements; #temporary_batch_1711196317277 |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1216/rmjm/1181069871 / rank | |||
| Property / cites work | |||
| Property / cites work: Q3859845 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3259107 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two Tables of Partitions / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1216/RMJM/1181069871 / rank | |||
Normal rank | |||
Latest revision as of 11:19, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recurrences for the partition function and its relatives |
scientific article |
Statements
Recurrences for the partition function and its relatives (English)
0 references
1 October 2004
0 references
Two new recurrences are given for the unrestricted partition function \(p(n)\), one of which is more efficient than Euler's pentagonal number recurrence. Recurrence formulas are also given in terms of \(p(n)\) for the function \(q(n)\), representing the number of partitions of \(n\) into distinct parts, and for the function \(q_0(n)\), representing the number of partitions of \(n\) into distinct odd parts.
0 references
