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 A095095 #12 Jan 25 2023 18:00:14
%S A095095 0,0,0,3,4,9,16,33,59,107,204,376,719,1335,2521,4804,9089,17311,33100,
%T A095095 63352,121283
%N A095095 Number of A080115-primes in range [2^n,2^(n+1)].
%H A095095 A. Karttunen and J. Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>
%H A095095 <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 A095095 a(n) = A036378(n) - A095094(n).
%o A095095 (PARI) is(p) = {my(s=0); if(isprime(p), for(i=1, (p-1)/2, if((s+=kronecker(i, p))<0, return(1)))); 0; }
%o A095095 a(n) = sum(p=2^n+1, 2^(n+1), is(p)); \\ _Jinyuan Wang_, Jul 20 2020
%Y A095095 Cf. A080115.
%K A095095 nonn,more
%O A095095 1,4
%A A095095 _Antti Karttunen_, Jun 01 2004