A generalization of Euler's pentagonal number recurrence for the partition function

DOI10.1007/S11139-014-9574-7zbMATH Open1320.05011OpenAlexW2083552263MaRDI QIDQ496342FDOQ496342

Authors: Mircea Merca 

Publication date: 21 September 2015

Published in: The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11139-014-9574-7

Recommendations

• New recurrences for Eulers partition function
• scientific article; zbMATH DE number 2108079
• Recurrences for the partition function and its relatives
• New partition function recurrences
• Some finite generalizations of Euler's pentagonal number theorem.

zbMATH Keywords

inequalitypartition functioninteger partition

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial identities, bijective combinatorics (05A19) Combinatorial inequalities (05A20)

Cites Work

• The On-Line Encyclopedia of Integer Sequences
• Title not available (Why is that?)
• Fast algorithm for generating ascending compositions
• The truncated pentagonal number theorem

Cited In (9)

• Title not available (Why is that?)
• A reversal of Schur's partition theorem
• Generalized Lambert series and Euler's pentagonal number theorem
• A further look at cubic partitions
• Title not available (Why is that?)
• The number of partitions of a natural number \(n\) into parts each of which is not less than \(m\)
• New recurrences for Eulers partition function
• 6-regular partitions: new combinatorial properties, congruences, and linear inequalities
• Computing the integer partition function

Uses Software

• OEIS

This page was built for publication: A generalization of Euler's pentagonal number recurrence for the partition function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496342)