On the number of partitions of $n$ whose product of the summands is at most $n$
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$.
How to Cite
Copyright (c) 2022 Author(s)
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution (CC-BY) 4.0 License that allows others to share the work with an acknowledgment of the work’s authorship and initial publication in this journal.
Provided they are the owners of the copyright to their work, authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal’s published version of the work (e.g., post it to an institutional repository, in a journal or publish it in a book), with an acknowledgment of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories, disciplinary repositories, or on their website) prior to and during the submission process.