OFFSET
1,4
COMMENTS
a(n) is a function of the prime signature of n (cf. A025487). - Matthew Vandermast, Jun 24 2012
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..65537 (first 10000 terms from Vincenzo Librandi)
FORMULA
From Antti Karttunen, Aug 30 2018: (Start)
Additive with a(p^e) = A000041(e).
Sum_{k=1..n} a(k) ~ n * (log(log(n)) + B + C), where B is Mertens's constant (A077761) and C = Sum_{p prime} f(1/p) = 1.03089282973521424158..., where f(x) = -1 + (1-x) * Product_{k>=1} (1 + x^k)/(1 - x^(2*k)). - Amiram Eldar, Sep 29 2023
MAPLE
a:= n-> add(combinat[numbpart](i[2]), i=ifactors(n)[2]):
seq(a(n), n=1..100); # Alois P. Heinz, Aug 30 2018
MATHEMATICA
Prepend[ Array[ Plus @@ (PartitionsP /@ Last[ Transpose[ FactorInteger[ # ] ] ])&, 100, 2 ], 0 ]
(* Second program: *)
Array[Total[PartitionsP /@ FactorInteger[#][[All, -1]] - Boole[# == 1]] &, 87] (* Michael De Vlieger, Sep 02 2018 *)
PROG
(PARI) A008481(n) = vecsum(apply(e -> numbpart(e), factor(n)[, 2])); \\ Antti Karttunen, Aug 30 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
Term a(1) corrected from 1 to 0 (for an empty sum) by Antti Karttunen, Aug 30 2018
STATUS
approved