login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125030 a(n) = sum of exponents in the prime factorization of n that are noncomposite. 4
0, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 3, 1, 2, 2, 0, 1, 3, 1, 3, 2, 2, 1, 4, 2, 2, 3, 3, 1, 3, 1, 5, 2, 2, 2, 4, 1, 2, 2, 4, 1, 3, 1, 3, 3, 2, 1, 1, 2, 3, 2, 3, 1, 4, 2, 4, 2, 2, 1, 4, 1, 2, 3, 0, 2, 3, 1, 3, 2, 3, 1, 5, 1, 2, 3, 3, 2, 3, 1, 1, 0, 2, 1, 4, 2, 2, 2, 4, 1, 4, 2, 3, 2, 2, 2, 6, 1, 3, 3, 4, 1, 3, 1, 4, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
From Amiram Eldar, Sep 30 2023: (Start)
Additive with a(p^e) = e if e is composite, and 0 otherwise.
Sum_{k=1..n} a(k) ~ n * (log(log(n)) + B + C), where B is Mertens's constant (A077761) and C = - P(2) + Sum_{p prime} p * (P(p) - P(p+1)) = 0.52262278983683613884..., where P(s) is the prime zeta function. (End)
EXAMPLE
a(720) = 3, since the prime factorization of 720 is 2^4 * 3^2 * 5^1 and two of the exponents in this factorization are noncomposites (the exponents 2 and 1, whose sum is 3).
MATHEMATICA
f[n_] := Plus @@ Select[Last /@ FactorInteger[n], # == 1 || PrimeQ[ # ] &]; Table[f[n], {n, 110}] (* Ray Chandler, Nov 19 2006 *)
PROG
(PARI) A125030(n) = vecsum(apply(e -> if((1==e)||isprime(e), e, 0), factorint(n)[, 2])); \\ Antti Karttunen, Jul 07 2017
CROSSREFS
Sequence in context: A325568 A326195 A073811 * A116479 A366989 A318322
KEYWORD
nonn,easy
AUTHOR
Leroy Quet, Nov 16 2006
EXTENSIONS
Extended by Ray Chandler, Nov 19 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 11:46 EDT 2024. Contains 371241 sequences. (Running on oeis4.)