login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A336567
Sum of proper divisors of {n divided by its largest squarefree divisor}.
3
0, 0, 0, 1, 0, 0, 0, 3, 1, 0, 0, 1, 0, 0, 0, 7, 0, 1, 0, 1, 0, 0, 0, 3, 1, 0, 4, 1, 0, 0, 0, 15, 0, 0, 0, 6, 0, 0, 0, 3, 0, 0, 0, 1, 1, 0, 0, 7, 1, 1, 0, 1, 0, 4, 0, 3, 0, 0, 0, 1, 0, 0, 1, 31, 0, 0, 0, 1, 0, 0, 0, 16, 0, 0, 1, 1, 0, 0, 0, 7, 13, 0, 0, 1, 0, 0, 0, 3, 0, 1, 0, 1, 0, 0, 0, 15, 0, 1, 1, 8, 0, 0, 0, 3, 0
OFFSET
1,8
FORMULA
a(n) = A001065(A003557(n)).
a(n) = A335341(n) - A003557(n) = A336563(n) / A007947(n).
PROG
(PARI)
A007947(n) = factorback(factorint(n)[, 1]);
A057723(n) = { my(r=A007947(n)); (r*sigma(n/r)); };
A336563(n) = (A057723(n)-n);
A336567(n) = (A336563(n)/A007947(n));
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jul 27 2020
STATUS
approved