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 A095008 #14 Jun 12 2024 03:48:37 %S A095008 1,1,1,3,3,7,13,22,37,71,128,231,440,807,1519,2872,5371,10204,19341, %T A095008 36759,70179,134241,256856,492936,947272,1822615,3513691,6781495, %U A095008 13103816,25348667,49092241,95168205,184661253,358636497,697094872,1356052491,2639893495,5142817901 %N A095008 Number of 4k+3 primes (A002145) in range ]2^n,2^(n+1)]. %H A095008 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>. %H A095008 <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 A095008 a(n) = A036378(n) - A095007(n) = A095010(n) + A095012(n) = A095092(n) + A095093(n). %Y A095008 Cf. A002145, A036378, A095007, A095010, A095012, A095092, A095093. %K A095008 nonn,less %O A095008 1,4 %A A095008 _Antti Karttunen_ and _Labos Elemer_, Jun 01 2004 %E A095008 a(34)-a(38) from _Amiram Eldar_, Jun 12 2024