On the Oppenheim's "factorisatio numerorum" function

Florian Luca, Anirban Mukhopadhyay, Kotyada Srinivas

Let $f(n)$ denote the number of distinct unordered factorisations of the natural number $n$ into factors larger than 1.In this paper, we address some aspects of the function $f(n)$…