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 A095057 #15 Mar 31 2012 14:02:22 %S A095057 0,0,0,2,2,5,4,10,6,13,11,9,16,16,18,25,15,19,15,37,17,37,29,29,32,40, %T A095057 23,49,31,51,39,37,30,52,46,40,42,62,43,57,42,68,52,78,60,89,54,63,59, %U A095057 92,58,79,82,99,73,87,47,99,74,72,81,106,56,102,85,117,85,97,64,132,93 %N A095057 Number of primes with four 1-bits (A095077) in range ]2^n,2^(n+1)]. %H A095057 T. D. Noe, <a href="/A095057/b095057.txt">Table of n, a(n) for n=1..200</a> %H A095057 A. Karttunen and J. Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a> %H A095057 Samuel S. Wagstaff, Jr., <a href="http://www.emis.de/journals/EM/expmath/volumes/10/10.html">Prime Numbers with a fixed number of one bits or zero bits in their binary representation</a>, Exp. Math. vol. 10, issue 2 (2001) 267, Table 2. %H A095057 <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 A095057 Cf. A095018, A095056, A095077. %K A095057 nonn %O A095057 1,4 %A A095057 _Antti Karttunen_, Jun 01 2004 %E A095057 More terms from _T. D. Noe_, Oct 17 2007