OFFSET
1,6
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..20000
FORMULA
a(p^k) = 1 for primes p and k >= 1. For k = 1, we have 1'*mu(1)^2 + p'*mu(p)^2 = 0*1 + 1*1 = 1. For all k >= 2, mu(p^k)^2 = 0. Therefore, a(p^k) = 0*1 + 1*1 + (0 + ... + 0) [k-1 times] = 1.
EXAMPLE
a(10) = 9; a(10) = 1' + 2' + 5' + 10' = 0 + 1 + 1 + 7 = 9.
PROG
(PARI) ad(n) = vecsum([n/f[1]*f[2]|f<-factor(n+!n)~]); \\ A003415
a(n) = sumdiv(n, d, ad(d)*moebius(d)^2); \\ Michel Marcus, Oct 10 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Oct 09 2021
STATUS
approved