Recurrences for the partition function and its relatives
type: Item
instance of: scholarly article
title: Recurrences for the partition function and its relatives
zbMATH Open document ID: 1085.11050
published in: Rocky Mountain Journal of Mathematics
publication date: 2004-10-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 11P81
Mathematics Subject Classification ID: 05A17
zbMATH DE Number: 2104654
author: John A. Ewell
reviewed by: Tom M. Apostol
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1216/rmjm/1181069871
OpenAlex ID: W2007719507
Wikidata QID: Q60059729
cites work: Q3859845
cites work: Q3259107
cites work: Two Tables of Partitions
DOI: 10.1216/RMJM/1181069871
Recommended article: Recurrence properties of partition functions
Recommended article: Q4820490
Recommended article: New partition function recurrences
Recommended article: On parity and recurrences for certain partition functions.
Recommended article: Generalizing the recursion relationship for the partition function
Recommended article: Partition Recurrences
Recommended article: New recurrences for Euler''s partition function
Recommended article: Q4989383
Recommended article: Über eine Rekursionsformel in der Theorie der Partitionen
description: scientific article; zbMATH DE number 2104654