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 A095013 #14 Jun 12 2024 03:49:56 %S A095013 0,1,0,3,2,8,10,22,35,67,126,233,438,793,1525,2825,5391,10192,19332, %T A095013 36739,70163,133983,256877,492962,946938,1822776,3513544,6780795, %U A095013 13102754,25349101,49090527,95168113,184659769,358635803,697092152,1356042601,2639892053,5142809798 %N A095013 Number of 8k+-1 primes (A001132) in range [2^n,2^(n+1)]. %H A095013 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>. %H A095013 <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 A095013 a(n) = A036378(n) - A095014(n) = A095009(n) + A095012(n). %Y A095013 Cf. A001132, A036378, A095009, A095012, A095014. %K A095013 nonn %O A095013 1,4 %A A095013 _Antti Karttunen_ and _Labos Elemer_, Jun 01 2004 %E A095013 a(34)-a(38) from _Amiram Eldar_, Jun 12 2024