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 A095015 #16 Jun 12 2024 03:50:29 %S A095015 0,1,1,2,3,7,11,20,37,69,126,228,434,806,1514,2845,5361,10212,19308, %T A095015 36747,70135,134065,256824,492871,946880,1822913,3513737,6780428, %U A095015 13103565,25348226,49090715,95167496,184660541,358633265,697094862,1356047971,2639884795,5142811282 %N A095015 Number of 6k+1 primes (A002476) in range ]2^n,2^(n+1)]. %H A095015 Antti Karttunen and John Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>. %H A095015 <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 A095015 a(n) = A036378(n) - A095016(n) for n >= 2. %Y A095015 Cf. A002476, A036378, A095016. %K A095015 nonn %O A095015 1,4 %A A095015 _Antti Karttunen_ and _Labos Elemer_, Jun 01 2004 %E A095015 a(34)-a(38) from _Amiram Eldar_, Jun 12 2024