close
login
A398530
a(n) = Sum_{k=1..n} f(floor(n/k)), where f(n) = A034444(n) is the number of unitary divisors (or squarefree divisors) of n.
2
1, 3, 4, 6, 7, 11, 10, 12, 13, 17, 16, 22, 21, 23, 24, 24, 25, 31, 30, 36, 35, 35, 34, 42, 41, 43, 42, 46, 45, 57, 52, 52, 53, 55, 54, 62, 61, 63, 62, 68, 67, 77, 72, 74, 75, 75, 74, 82, 79, 83, 84, 86, 85, 91, 90, 94, 93, 93, 92, 114, 109, 107, 106, 104, 105, 113, 108, 112, 111, 119
OFFSET
1,2
LINKS
Olivier Bordellès, On certain sums of number theory, International Journal of Number Theory, Vol. 18, No. 9 (2022), pp. 2053-2074; arXiv preprint, arXiv:2009.05751 [math.NT], 2020.
Kui Liu, Jie Wu, and Zhishan Yang, On some sums involving the integral part function, International Journal of Number Theory, Vol. 20, No. 3 (2024), pp. 831-847; arXiv preprint, arXiv:2109.01382 [math.NT], 2021.
Wei Zhang, On a variant of the prime number theorem, Journal of Number Theory, Vol. 257 (2024), pp. 163-185; arXiv preprint, arXiv:2303.12347 [math.NT], 2023.
FORMULA
a(n) = c * n + O(n^(97/202 + eps)), for any eps > 0, where c = 1.695701... = A398531 (Bordellès, 2022).
The exponent in the error term was further improved to 9/19 + eps (Liu et al., 2024), and 107/229 + eps (Zhang, 2024).
MATHEMATICA
a[n_] := Sum[2^PrimeNu[Floor[n/k]], {k, 1, n}]; Array[a, 70]
PROG
(PARI) a(n) = sum(k = 1, n, 1 << omega(n\k));
CROSSREFS
Sequence in context: A194095 A064404 A294488 * A364341 A335059 A047514
KEYWORD
nonn,easy
AUTHOR
Amiram Eldar, Aug 01 2026
STATUS
approved