login
A369747
a(n) = Sum_{p|n, p prime} pi(n/p).
2
0, 0, 0, 1, 0, 3, 0, 2, 2, 4, 0, 5, 0, 5, 5, 4, 0, 7, 0, 6, 6, 6, 0, 9, 3, 7, 4, 8, 0, 13, 0, 6, 7, 8, 7, 12, 0, 9, 8, 12, 0, 17, 0, 10, 10, 10, 0, 15, 4, 13, 9, 11, 0, 16, 8, 13, 10, 11, 0, 23, 0, 12, 12, 11, 9, 22, 0, 13, 11, 21, 0, 20, 0, 13, 15, 14, 9, 24, 0, 18, 9
OFFSET
1,6
FORMULA
a(p^k) = pi(p^(k-1)), for p prime and k >= 1. - Wesley Ivan Hurt, Jun 26 2024
MATHEMATICA
Table[DivisorSum[n, PrimePi[n/#] &, PrimeQ[#] &], {n, 100}]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, Jan 30 2024
STATUS
approved