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