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 A095094 #11 Jul 20 2020 06:41:26
%S A095094 1,2,2,2,3,4,7,10,16,30,51,88,153,277,509,905,1660,3079,5535,10234,
%T A095094 19053
%N A095094 Number of A080114-primes in range ]2^n,2^(n+1)].
%H A095094 A. Karttunen and J. Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>
%H A095094 <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 A095094 a(n) = A036378(n) - A095095(n).
%o A095094 (PARI) is(p) = {if(!isprime(p), return(0)); my(s=0); for(i=1, (p-1)/2, if((s+=kronecker(i, p))<0, return(0))); 1; }
%o A095094 a(n) = sum(p=2^n+1, 2^(n+1), is(p)); \\ _Jinyuan Wang_, Jul 20 2020
%Y A095094 Cf. A080114.
%K A095094 nonn,more
%O A095094 1,2
%A A095094 _Antti Karttunen_, Jun 01 2004