On the smallest abundant number not divisible by the first \(k\) primes (Q558379)

A positive integer \(n\) is called abundant, if \(\sigma(n)>2n\), where \(\sigma(n)\) denotes the sum of the positive divisors of \(n\). The smallest odd abundant number is 945. Let \(p_1=2, p_2=3, p_3,p_4,\dots\) the primes in ascending order. The author denotes by \(A(k)\) the smallest abundant number not divisible by \(p_1,p_2,\dots,p_k\) and proves elementarily \[ (1-\varepsilon)(k\ln k)^{2-\varepsilon}<\ln A(k)<(1+ \varepsilon)(k \ln k)^{2+\varepsilon}, \] whenever \(k\) is sufficiently large and computes \(A(k)\) for \(1\leq k\leq 7\).