OFFSET
1,2
COMMENTS
For each divisor d of n, add 1 if d is prime, else add n.
Inverse Möbius transform of A385313(n).
FORMULA
a(n) = n*tau(n) - (n-1)*omega(n).
a(n) = Sum_{d|n} n^c(d), where c = A005171.
a(n) = Sum_{d|n} A385313(d).
a(p^k) = 1 + k*p^k for p prime and k>=1. - Wesley Ivan Hurt, Jul 02 2025
EXAMPLE
12 has 2 prime divisors and 4 nonprime divisors, so a(12) = (2) + 12*(4) = 50.
MATHEMATICA
Table[n*DivisorSigma[0, n] - (n - 1) PrimeNu[n], {n, 100}]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, Jun 21 2025
STATUS
approved
