Product partitions and recursion formulae.
Subbarao, M.V. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Recursive formulae for the multiplicative partition function.”
Product partitions and recursion formulae.
Extending a recent result of Santos on partitions into odd parts.
Sellers, James A. (2003)
Integers
Similarity:
On the parity of the number of multiplicative partitions
Alexandru Zaharescu, Mohammad Zaki (2010)
Acta Arithmetica
Similarity:
On a restricted -non-squashing partition function.
Rødseth, Øystein, Sellers, James A. (2005)
Journal of Integer Sequences [electronic only]
Similarity:
A combinatorial proof of a partition identity of Andrews and Stanley.
Sills, Andrew V. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Partitions excluding specific polygonal numbers as parts.
Sellers, James A. (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Maximum product over partitions into distinct parts.
Došlić, Tomislav (2005)
Journal of Integer Sequences [electronic only]
Similarity:
A refinement of a partition theorem of Sellers.
Chen, Kuo-Jye (2004)
Integers
Similarity:
A combinatorial proof of Andrews' smallest parts partition function.
Ji, Kathy Qing (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Three restricted product-sum partition functions
L. Chawla, Ellen Torrance (1977)
Acta Arithmetica
Similarity:
A note on the exact expected length of the th part of a random partition.
Eriksson, Kimmo (2010)
Integers
Similarity:
Parity indices of partitions
Kağan Kurşungöz (2010)
Acta Arithmetica
Similarity:
Combinatorial interpretations for identities using chromatic partitions
Mateus Alegri, Wagner Ferreira Santos, Samuel Brito Silva (2021)
Czechoslovak Mathematical Journal
Similarity:
We provide combinatorial interpretations for three new classes of partitions, the so-called chromatic partitions. Using only combinatorial arguments, we show that these partition identities resemble well-know ordinary partition identities.