|
Search: id:A008472
|
|
|
| A008472 |
|
a(n) = the sum of the distinct primes dividing n. |
|
+0
120
|
|
| 0, 2, 3, 2, 5, 5, 7, 2, 3, 7, 11, 5, 13, 9, 8, 2, 17, 5, 19, 7, 10, 13, 23, 5, 5, 15, 3, 9, 29, 10, 31, 2, 14, 19, 12, 5, 37, 21, 16, 7, 41, 12, 43, 13, 8, 25, 47, 5, 7, 7, 20, 15, 53, 5, 16, 9, 22, 31, 59, 10, 61, 33, 10, 2, 18, 16, 67, 19, 26, 14, 71, 5, 73
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Sometimes called sopf(n).
Equals A051731 * A061397 = inverse Mobius transform of [0, 2, 3, 0, 5, 0, 7,...]. - Gary W. Adamson (qntmpkt(AT)yahoo.com), Feb 14 2008
|
|
LINKS
|
Franklin T. Adams-Watters, Table of n, a(n) for n = 1..10000
|
|
FORMULA
|
n = Product(p_j^k_j) -> Sum (p_j).
Additive with a(p^e) = p.
|
|
MAPLE
|
A008472 := proc(n) local t1, i; if n=1 then RETURN(0) else t1 := 0; for i from 1 to n do if n mod ithprime(i) = 0 then t1 := t1+ithprime(i); fi; od; fi; t1; end;
|
|
MATHEMATICA
|
Prepend[ Array[ Plus @@ First[ Transpose[ FactorInteger[ # ] ] ]&, 100, 2 ], 0 ]
|
|
PROGRAM
|
(PARI) sopf(n) = local(fac, i); fac=factor(n); sum(i=1, matsize(fac)[1], fac[i, 1])
|
|
CROSSREFS
|
Cf. A001414 (sopfr), A001222.
Cf. A051731, A061397.
Adjacent sequences: A008469 A008470 A008471 this_sequence A008473 A008474 A008475
Sequence in context: A095402 A086294 A075860 this_sequence A123528 A074036 A074251
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Olivier Gerard (ogerard(AT)ext.jussieu.fr)
|
|
|
Search completed in 0.003 seconds
|
