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.
%I A087011 #16 Sep 08 2022 08:45:11
%S A087011 0,1,1,1,1,2,2,1,1,2,2,2,2,2,2,3,3,3,3,2,2,3,3,3,3,3,3,3,3,4,4,3,3,4,
%T A087011 4,5,5,5,5,6,6,7,7,6,6,6,6,5,5,5,5,6,6,7,7,7,7,7,7,6,6,6,6,7,7,8,8,7,
%U A087011 7,8,8,7,7,7,7,8,8,8,8,7,7,8,8,8,8,8,8,8,8,9,9,9,9,9,9,10,10,10,10,11,11,11
%N A087011 Number of primes of form 4*k+3 between n and 2n (inclusive).
%C A087011 Erdős proved that between any n > 7 and its double there are always at least two primes, one of form 4*k+1 and one of form 4*k+3.
%D A087011 B. Schechter, "My Brain is Open: The Mathematical Journeys of Paul Erdős," Simon & Schuster, New York, 1998, p. 62.
%H A087011 Amiram Eldar, <a href="/A087011/b087011.txt">Table of n, a(n) for n = 1..10000</a>
%t A087011 a[n_] := Module[{c = 0}, Do[If[Mod[k, 4] == 3 && PrimeQ[k], c++], {k, n, 2 n}]; c]; Array[a, 100] (* _Amiram Eldar_, Dec 16 2019 *)
%o A087011 (Magma) [#[p:p in PrimesInInterval(n,2*n)| p mod 4 eq 3]:n in [1..100]]; // _Marius A. Burtea_, Dec 16 2019
%Y A087011 Cf. A035250, A087010, A087012.
%K A087011 nonn
%O A087011 1,6
%A A087011 _Jason Earls_, Jul 30 2003