OFFSET
1,3
COMMENTS
Additive with a(p^e) = e * (PrimePi(p)!), where PrimePi(n) = A000720(n).
a(3181) has 1001 decimal digits. - Michael De Vlieger, Dec 24 2017
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..3180 (First 120 terms from Antti Karttunen).
FORMULA
MATHEMATICA
Array[If[# == 1, 0, Total[FactorInteger[#] /. {p_, e_} /; p > 1 :> e PrimePi[p]!]] &, 66] (* Michael De Vlieger, Dec 24 2017 *)
PROG
(Scheme, with memoization-macro definec)
(definec (A276075 n) (cond ((= 1 n) (- n 1)) (else (+ (* (A067029 n) (A000142 (A055396 n))) (A276075 (A028234 n))))))
(Python)
from sympy import factorint, factorial as f, primepi
def a(n):
F=factorint(n)
return 0 if n==1 else sum(F[i]*f(primepi(i)) for i in F)
print([a(n) for n in range(1, 121)]) # Indranil Ghosh, Jun 21 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Aug 18 2016
STATUS
approved