The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A366073 The number of composite "Fermi-Dirac primes" (A082522) dividing n. 2
0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 2, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 2, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 2, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 1, 1, 0, 0, 0, 2, 2, 0, 0, 1, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,16
COMMENTS
First differs from A071325 at n = 36.
The number of "Fermi-Dirac primes" that are infinitary divisors of n is A064547(n).
LINKS
FORMULA
Additive with a(p^e) = floor(log_2(e)) = A000523(e).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{k>=1} P(2^k) = 0.53331724743088069672..., where P(s) is the prime zeta function.
MATHEMATICA
f[p_, e_] := Floor[Log2[e]]; a[1] = 0; a[n_] := Plus @@ f @@@ FactorInteger[n]; Array[a, 100]
PROG
(PARI) a(n) = vecsum(apply(exponent, factor(n)[, 2]));
CROSSREFS
Sequence in context: A322338 A158971 A121467 * A362412 A071325 A064727
KEYWORD
nonn,easy
AUTHOR
Amiram Eldar, Sep 28 2023
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 June 11 08:50 EDT 2024. Contains 373295 sequences. (Running on oeis4.)