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 A095011 #16 Jun 12 2024 03:49:25
%S A095011 0,1,1,1,3,2,6,11,20,35,63,118,216,407,759,1424,2686,5094,9652,18472,
%T A095011 35068,67068,128421,246403,473647,911479,1757076,3390256,6552075,
%U A095011 12675294,24545280,47583568,92332958,179313476,348551899,678031524,1319932086,2571422341
%N A095011 Number of 8k+5 primes (A007521) in range ]2^n,2^(n+1)].
%H A095011 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>.
%H A095011 <a href="/index/Pri#primesubsetpop2">Index entries for sequences related to occurrences of various subsets of primes in range ]2^n,2^(n+1)]</a>.
%F A095011 a(n) = A095014(n) - A095010(n).
%t A095011 Module[{nn = 21, s}, s = Select[8 Range[0, 2^nn] + 5, PrimeQ]; Table[Count[s, _?(2^n < # < 2^(n + 1) &)], {n, nn}]] (* _Michael De Vlieger_, Jul 23 2017 *)
%Y A095011 Cf. A007521, A091128, A095010, A095014.
%K A095011 nonn
%O A095011 1,5
%A A095011 _Antti Karttunen_ and _Labos Elemer_, Jun 01 2004
%E A095011 a(34)-a(38) from _Amiram Eldar_, Jun 12 2024