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 A095093 #10 Jul 20 2020 06:41:22
%S A095093 0,0,0,1,1,3,6,12,21,41,77,143,287,530,1010,1967,3711,7125,13806,
%T A095093 26525,51126
%N A095093 Number of 4k+3 primes whose Legendre-vector is not Dyck-path (A095103) in range ]2^n,2^(n+1)].
%H A095093 A. Karttunen and J. Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>
%H A095093 <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 A095093 a(n) = A095008(n) - A095092(n).
%o A095093 (PARI) is(m) = {my(s=0); if(isprime(m), for(i=1, m-1, if((s+=kronecker(i, m))<0, return(1)))); 0; }
%o A095093 a(n) = {my(c=0); forstep(m=2^n+3, 2^(n+1), 4, c+=is(m)); c; } \\ _Jinyuan Wang_, Jul 20 2020
%Y A095093 Cf. A095103.
%K A095093 nonn,more
%O A095093 1,6
%A A095093 _Antti Karttunen_, Jun 01 2004