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 A095009 #14 Jun 12 2024 03:48:58 %S A095009 0,0,0,1,1,4,4,10,18,31,64,115,216,398,752,1413,2692,5092,9642,18355, %T A095009 35089,66907,128431,246479,473201,911650,1756523,3390156,6551387, %U A095009 12673576,24545135,47583812,92329094,179317195,348545465,678019818,1319938243,2571401536 %N A095009 Number of 8k+1 primes (A007519) in range ]2^n,2^(n+1)]. %H A095009 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>. %H A095009 <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 A095009 a(n) = A095013(n) - A095012(n) = A095007(n) - A095011(n). %Y A095009 Cf. A007519, A091126, A095007, A095011, A095012, A095013. %K A095009 nonn %O A095009 1,6 %A A095009 _Antti Karttunen_ and _Labos Elemer_, Jun 01 2004 %E A095009 a(34)-a(38) from _Amiram Eldar_, Jun 12 2024