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 A095012 #16 Jun 12 2024 03:49:41
%S A095012 0,1,0,2,1,4,6,12,17,36,62,118,222,395,773,1412,2699,5100,9690,18384,
%T A095012 35074,67076,128446,246483,473737,911126,1757021,3390639,6551367,
%U A095012 12675525,24545392,47584301,92330675,179318608,348546687,678022783,1319953810,2571408262
%N A095012 Number of 8k+7 primes (A007522) in range ]2^n,2^(n+1)].
%H A095012 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>.
%H A095012 <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 A095012 a(n) = A095013(n) - A095009(n).
%t A095012 Module[{nn = 21, s}, s = Select[8 Range[0, 2^nn] + 7, PrimeQ]; Table[Count[s, _?(2^n < # < 2^(n + 1) &)], {n, nn}]] (* _Michael De Vlieger_, Jul 23 2017 *)
%Y A095012 Cf. A007522, A091129, A095009, A095013.
%K A095012 nonn
%O A095012 1,4
%A A095012 _Antti Karttunen_ and _Labos Elemer_, Jun 01 2004
%E A095012 a(34)-a(38) from _Amiram Eldar_, Jun 12 2024