Asymptotic distribution of integers with certain prime factorizations (Q2637180)

Let \(\{p_i\}_{i=1}^{\infty}\) denote the sequence of prime numbers arranged in increasing order. For \(m>1\) define the set of integers \(A_m\) by \[ A_m = \{p_{m^{k_1}}p_{m^{k_2}}\cdots p_{m^{k_n}} \in \mathbb{N} : 0 \leq k_1 \leq k_2 \cdots \leq k_n\}. \] The main result of the paper is an asymptotic formula for \[ M_{2,m}(x) := \sum_{n \leq x \atop n \in A_m} 1, \] which is too involved to reproduce here. The proof uses an extension of a classical theorem of Ingham on the asymptotics of partitions. The paper also contains a discussion of \(M_{2,2}\) as the counting function of certain rooted trees and as an ordinal counting function.