Coppersmith, Don; Lewenstein, Moshe Constructive bounds on ordered factorizations. (English) Zbl 1090.05004 SIAM J. Discrete Math. 19, No. 2, 301-303 (2005). Summary: The number of ways to factor a natural number \(n\) 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. Cited in 5 Documents MSC: 11N56 Rate of growth of arithmetic functions 05A17 Combinatorial aspects of partitions of integers 05A15 Exact enumeration problems, generating functions 05A05 Permutations, words, matrices Keywords:Riemann zeta function PDFBibTeX XMLCite \textit{D. Coppersmith} and \textit{M. Lewenstein}, SIAM J. Discrete Math. 19, No. 2, 301--303 (2005; Zbl 1090.05004) Full Text: DOI