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 A095326 #10 Mar 27 2022 14:22:54 %S A095326 1,2,2,5,7,13,20,42,65,122,203,412,718,1413,2381,4859,8266,16955, %T A095326 28995,60484,105524,216830,376969,785885,1383287,2867949,5044969, %U A095326 10544609,18699214,39034399,69349061,145210901,259051224 %N A095326 Number of A095316-primes in range [2^n,2^(n+1)]. %C A095326 Ratios a(n)/A036378(n) converge as: 1, 1, 1, 1, 1, 1, 0.869565, 0.976744, 0.866667, 0.890511, 0.796078, 0.887931, 0.823394, 0.876551, 0.785809, 0.851112, 0.769002, 0.831535, 0.750485, 0.82195, 0.751938, 0.808416, 0.73382, 0.797191, 0.730306, 0.786657, 0.717911, 0.777517, 0.713512, 0.769947, 0.706327, 0.76292, 0.701421 %H A095326 A. Karttunen and J. Moyer: <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a> %H A095326 <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> %Y A095326 a(n) = A036378(n)-A095327(n). %K A095326 nonn %O A095326 1,2 %A A095326 _Antti Karttunen_, Jun 04 2004