cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A372332 The number of "Fermi-Dirac primes" (A050376) that are noninfinitary divisors of n.

This page as a plain text file.
%I A372332 #6 Apr 28 2024 11:35:38
%S A372332 0,0,0,1,0,0,0,0,1,0,0,1,0,0,0,2,0,1,0,1,0,0,0,0,1,0,0,1,0,0,0,1,0,0,
%T A372332 0,2,0,0,0,0,0,0,0,1,1,0,0,2,1,1,0,1,0,0,0,0,0,0,0,1,0,0,1,1,0,0,0,1,
%U A372332 0,0,0,1,0,0,1,1,0,0,0,2,2,0,0,1,0,0,0
%N A372332 The number of "Fermi-Dirac primes" (A050376) that are noninfinitary divisors of n.
%H A372332 Amiram Eldar, <a href="/A372332/b372332.txt">Table of n, a(n) for n = 1..10000</a>
%F A372332 Additive with a(p^e) = A023416(e).
%F A372332 a(n) = log_2(A372331(n)).
%F A372332 Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{p prime} f(1/p) = 0.39726277693465233149..., where f(x) = Sum_{k>=0} x^(2^(k+1))/(1+x^(2^k)).
%t A372332 f[p_, e_] := DigitCount[e, 2, 0]; a[1] = 0; a[n_] := Plus @@ f @@@ FactorInteger[n]; Array[a, 100]
%o A372332 (PARI) a(n) = vecsum(apply(x -> logint(x, 2) + 1 - hammingweight(x), factor(n)[, 2]));
%Y A372332 Cf. A023416, A050376, A064547, A348341, A372331.
%K A372332 nonn,easy
%O A372332 1,16
%A A372332 _Amiram Eldar_, Apr 28 2024