On the number of ordered factorizations of natural numbers

We study the number of ways to factor a natural number n into an ordered product of integers, each factor greater than one, denoted by H(n). This counting function from number theory was shown by Newberg and Naor (Adv. Appl. Math. 14 (1993) 172

• Type: Journal
• Year: 2000
• Where: DM
• Authors: Benny Chor, Paul Lemke, Ziv Mador
• Keywords: DM 2000, Lower Bound, Probed Partial Digest, Tight Asymptotic Upper