On the Oppenheim's "factorisatio numerorum" function

2008/07/07 by Florian Luca, Luca, Florian, Anirban Mukhopadhyay +4
Mathematics · #Advanced Mathematical Identities #Advanced Mathematical Theories #FOS: Mathematics #Mathematics and Applications #Number Theory (math.NT) #math.NT

paper · pdf · doi:10.48550/arxiv.0807.0986

14 pages

arxiv created 2008/07/07 · openalex publication_date 2008/07/07 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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).

Citations

• Asymptotic Formulaae in Combinatory Analysis

Related

• On the number of factorizations of an integer
• Counting number of factorizations of a natural number
• On the maximal order of numbers in the "factorisatio numerorum" problem
• Unordered Factorizations with k Parts
• On factorizations into coprime parts