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 A095292 #8 Oct 09 2013 13:46:53 %S A095292 1,0,1,1,3,4,9,14,23,47,88,152,295,540,1004,1933,3572,6805,12909, %T A095292 24461,46767,89481,171327,328638,631302,1215243,2342291,4520976, %U A095292 8736608,16899331,32727125,63446234,123106396 %N A095292 Number of A095282-primes in range ]2^n,2^(n+1)]. %H A095292 A. Karttunen and J. Moyer: <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a> %H A095292 <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> %o A095292 (PARI) a(n)=my(s);forprime(p=2^n+1,2^(n+1), s+=valuation(p+1, 2)%2==0); s \\ _Charles R Greathouse IV_, Oct 09 2013 %Y A095292 a(n) = A036378(n)-A095293(n). Cf. A095006. %K A095292 nonn %O A095292 1,5 %A A095292 _Antti Karttunen_, Jun 04 2004