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 A095327 #7 Mar 31 2012 14:02:23 %S A095327 0,0,0,0,0,0,3,1,10,15,52,52,154,199,649,850,2483,3435,9640,13102, %T A095327 34812,51386,136739,199933,510833,777795,1982321,3017298,7508064, %U A095327 11663138,28833595,45124684,110272081 %N A095327 Number of A095317-primes in range ]2^n,2^(n+1)]. %C A095327 Ratios a(n)/A036378(n) converge as: 0, 0, 0, 0, 0, 0, 0.130435, 0.023256, 0.133333, 0.109489, 0.203922, 0.112069, 0.176606, 0.123449, 0.214191, 0.148888, 0.230998, 0.168465, 0.249515, 0.17805, 0.248062, 0.191584, 0.26618, 0.202809, 0.269694, 0.213343, 0.282089, 0.222483, 0.286488, 0.230053, 0.293673, 0.23708, 0.298579, ... %H A095327 A. Karttunen and J. Moyer: <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a> %H A095327 <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 A095327 a(n) = A036378(n)-A095326(n). %K A095327 nonn %O A095327 1,7 %A A095327 _Antti Karttunen_