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 A095007 #14 Jun 12 2024 03:48:12 %S A095007 0,1,1,2,4,6,10,21,38,66,127,233,432,805,1511,2837,5378,10186,19294, %T A095007 36827,70157,133975,256852,492882,946848,1823129,3513599,6780412, %U A095007 13103462,25348870,49090415,95167380,184662052,358630671,697097364,1356051342,2639870329,5142823877 %N A095007 Number of 4k+1 primes (A002144) in range ]2^n,2^(n+1)]. %H A095007 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>. %H A095007 <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 A095007 a(n) = A036378(n) - A095008(n) = A095009(n) + A095011(n). %Y A095007 Cf. A002144, A036378, A095008, A095009, A095011. %K A095007 nonn %O A095007 1,4 %A A095007 _Antti Karttunen_ and _Labos Elemer_, Jun 01 2004 %E A095007 a(34)-a(38) from _Amiram Eldar_, Jun 12 2024