OFFSET
1,2
COMMENTS
Inverse Möbius transform of A005451(n).
For each divisor d of n, add 1 if d is prime, else add d.
FORMULA
a(n) = sigma(n) - sopf(n) + omega(n).
a(n) = Sum_{d|n} d^c(d), where c = A005171.
a(n) = Sum_{d|n} A005451(d).
a(p^k) = 1 - p + (p^(k+1)-1)/(p-1) for p prime, k >= 1. - Wesley Ivan Hurt, Jul 02 2025
MATHEMATICA
Table[DivisorSigma[1, n] - Sum[p, {p, Select[Divisors[n], PrimeQ]}] + PrimeNu[n], {n, 100}]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, Jun 21 2025
STATUS
approved
