Constructive Bounds on Ordered Factorizations
Don Coppersmith, Moshe Lewenstein · SIAM Journal on Discrete Mathematics · 2005
The number of ways to factor a natural number into an ordered product of integers, each factor greater than one, is called the ordered factorization of n and is denoted H(n). We show upper and lower bounds on H(n) with explicit constructions.