OFFSET
1,2
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
a(12) = 7; we have 2^1, 2^2 and 3^1 dividing 12, so a(12) = 2 + 2 + 3 = 7.
MAPLE
f:= proc(n) local F, t, s;
s:= 0;
F:= ifactors(n)[2];
for t in F do
s:= s + nops(select(i -> n mod i = 0, [$1..t[2]]))*t[1]
od;
s
end proc:
map(f, [$1..100]); # Robert Israel, Sep 28 2024
MATHEMATICA
Table[d = Divisors[n]; Total@ Map[#*LengthWhile[#^d, Divisible[n, #] &] &, Select[d, PrimeQ]], {n, 120}] (* Michael De Vlieger, Sep 29 2024 *)
PROG
(PARI) a(n) = my(f=factor(n), d=divisors(f)); sum(k=1, #f~, sum(m=1, #d, if ((n % f[k, 1]^d[m]) == 0, f[k, 1]))); \\ Michel Marcus, Feb 26 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Feb 25 2022
STATUS
approved