On some sums involving the counting function of nonisomorphic abelian groups (Q6115841)

Let \(a(n)\) be the number of nonisomorphic abelian groups of order \(n\), and for any fixed integer \(\ell\geq 2\) let \(d_\ell(n)\) denote the number of ways \(n\) can be written as a product of \(\ell\) natural numbers. In this paper, the authors prove that \[ \sum_{n\leq x}a(n+a(n))=Cx+O(x^{3/4+\varepsilon}), \] and \[ \sum_{n\leq x}d_\ell(n+a(n))=x\,Q_\ell(\log x)+O(x^{1-1/(2\ell)+\varepsilon}), \] where \(\varepsilon>0\) is arbitrary, \(C>0\) is an absolute constant, and \(Q_\ell\) is a polynomial of degree \(\ell-1\). The first approximation improves the previous \(O\)-term due to \textit{A. Ivić} [Publ. Elektroteh. Fak., Univ. Beogr., Ser. Mat. 3, 61--66 (1992; Zbl 0785.11048)]. A remarkable part of the proof concerns approximating the following sum running over an arithmetic progression \[ \sum_{\substack{n\leq x\\ n\equiv k\,\mathrm{mod}\,r}}a(n). \]