On the number of partitions of $n$ whose product of the summands is at most $n$

Abstract

We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.

arXiv comment5 pages. Published in Journal of the Assam Academy of Mathematics. URL: https://jaam.aamonline.org.in/ojs/index.php/j/article/view/59

References in corpus (1)

• Counting number of factorizations of a natural number