Recursively divisible numbers

DOI10.1016/j.jnt.2023.08.008arXiv1912.07979MaRDI QIDQ6184602

Thomas M. A. Fink

Publication date: 25 January 2024

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.07979

zbMATH Keywords

divisor functionhighly composite numbersnumber of ordered factorizationsrecursive divisor functionrecursively divisible numberssuper-abundant numbers

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Asymptotic results on counting functions for algebraic and topological structures (11N45) Arithmetic functions; related numbers; inversion formulas (11A25) Rate of growth of arithmetic functions (11N56)

Cites Work

• On the maximal order of numbers in the ``factorisatio numerorum problem
• Large values and champion numbers of Kalmár's arithmetic function
• On a problem of Oppenheim concerning Factorisatio Numerorum
• On the number of ordered factorizations of natural numbers
• The On-Line Encyclopedia of Integer Sequences
• On Highly Composite and Similar Numbers