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

DOI10.1007/s11139-014-9574-7zbMath1320.05011OpenAlexW2083552263MaRDI QIDQ496342

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

zbMATH Keywords

partition functioninequalityinteger partition

Mathematics Subject Classification ID

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

Related Items (4)

A further look at cubic partitions ⋮ Unnamed Item ⋮ 6-regular partitions: new combinatorial properties, congruences, and linear inequalities ⋮ A reversal of Schur's partition theorem

Uses Software

• OEIS

Cites Work

• The truncated pentagonal number theorem
• Fast algorithm for generating ascending compositions
• Unnamed Item
• Unnamed Item

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