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 A095010 #14 Jun 12 2024 03:49:12 %S A095010 1,0,1,1,2,3,7,10,20,35,66,113,218,412,746,1460,2672,5104,9651,18375, %T A095010 35105,67165,128410,246453,473535,911489,1756670,3390856,6552449, %U A095010 12673142,24546849,47583904,92330578,179317889,348548185,678029708,1319939685,2571409639 %N A095010 Number of 8k+3 primes (A007520) in range [2^n,2^(n+1)]. %H A095010 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>. %H A095010 <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 A095010 a(n) = A095014(n) - A095011(n) = A095008(n) - A095012(n). %Y A095010 Cf. A007520, A091127, A095008, A095011, A095012, A095014. %K A095010 nonn %O A095010 1,5 %A A095010 _Antti Karttunen_ and _Labos Elemer_, Jun 01 2004 %E A095010 a(34)-a(38) from _Amiram Eldar_, Jun 12 2024