Recurrences for the partition function and its relatives (Q1880824): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 05:05, 5 March 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