OFFSET
1,2
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..10000
A. Karttunen, Scheme-program for computing this sequence.
FORMULA
Additive with a(p^e) = p + a(e).
EXAMPLE
a(64) = 7, as 64 = 2^6 = 2^(2^1*3^1) and 2+2+3=7. Similarly, for 360 = 2^(3^1) * 3^(2^1) * 5^1 we get a(360) = 2+3+3+2+5 = 15. See comments at A106490.
MAPLE
a:= proc(n) option remember;
add(i[1]+a(i[2]), i=ifactors(n)[2])
end:
seq(a(n), n=1..100); # Alois P. Heinz, Nov 06 2014
MATHEMATICA
a[1] = 0; a[n_] := a[n] = #[[1]] + a[#[[2]]]& /@ FactorInteger[n] // Total; Array[a, 100] (* Jean-François Alcover, Mar 03 2016 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 09 2005 based on Leroy Quet's message ('Super-Factoring' An Integer) posted to SeqFan-mailing list on Dec 06 2003.
STATUS
approved