%I #32 Jul 07 2024 11:11:21
%S 0,0,1,0,0,1,1,0,1,0,1,1,0,1,1,0,0,1,1,0,2,1,1,1,0,0,1,1,0,1,1,0,2,0,
%T 1,1,0,1,1,0,0,2,1,1,1,1,1,1,1,0,1,0,0,1,1,1,2,0,1,1,0,1,2,0,0,2,1,0,
%U 2,1,1,1,0,0,1,1,2,1,1,0,1,0,1,2,0,1,1,1,0,1,1,1,2,1,1,1,0,1,2,0,0,1
%N Number of distinct primes = 3 mod 4 dividing n.
%H Reinhard Zumkeller, <a href="/A005091/b005091.txt">Table of n, a(n) for n = 1..10000</a>
%H Étienne Fouvry and Peter Koymans, <a href="https://arxiv.org/abs/2001.05350">On Dirichlet biquadratic fields</a>, arXiv:2001.05350 [math.NT], 2020.
%F Additive with a(p^e) = 1 if p = 3 (mod 4), 0 otherwise.
%F From _Reinhard Zumkeller_, Jan 07 2013: (Start)
%F a(n) = Sum_{k=1..A001221(n)} A079261(A027748(n,k)).
%F a(A072437(n)) = 0.
%F a(A187811(n)) > 0. (End)
%F a(n) = Sum_{p|n} (binomial(p,3) mod 2), where p is a prime. - _Ridouane Oudra_, Nov 19 2019
%p with(numtheory): seq(add(binomial(p,3) mod 2, p in factorset(n)), n=1..100); # _Ridouane Oudra_, Nov 19 2019
%t f[n_]:=Length@Select[If[n==1,{},FactorInteger[n]],Mod[#[[1]],4]==3&]; Table[f[n],{n,102}] (* _Ray Chandler_, Dec 18 2011 *)
%o (PARI) for(n=1,100,print1(sumdiv(n,d,isprime(d)*if((d-3)%4,0,1)),","))
%o (Haskell)
%o a005091 = sum . map a079261 . a027748_row
%o -- _Reinhard Zumkeller_, Jan 07 2013
%o (Magma) [0] cat [#[p:p in PrimeDivisors(n)| p mod 4 eq 3]: n in [2..100]]; // _Marius A. Burtea_, Nov 19 2019
%o (Magma) [0] cat [&+[Binomial(p,3) mod 2:p in PrimeDivisors(n)]:n in [2..100]]; // _Marius A. Burtea_, Nov 19 2019
%o (Python)
%o from sympy import primefactors
%o def A005091(n): return sum(1 for p in primefactors(n) if p&3==3) # _Chai Wah Wu_, Jul 07 2024
%Y Cf. A001221, A005089, A005094.
%Y Cf. A079261, A027748, A072437, A187811.
%K nonn
%O 1,21
%A _N. J. A. Sloane_