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 A095318 #12 Mar 03 2015 01:05:15
%S A095318 31,47,59,61,127,191,223,239,251,367,379,383,431,439,443,463,479,487,
%T A095318 491,499,503,509,607,631,701,719,727,733,743,751,757,761,823,827,829,
%U A095318 859,863,877,883,887,911,919,941,947,953,967,971,983,991
%N A095318 Primes in whose binary expansion the number of 1 bits is > 3 + number of 0 bits.
%H A095318 A. Karttunen and J. Moyer: <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>
%o A095318 (PARI) B(x) = { nB = floor(log(x)/log(2)); b1 = 0; b0 = 0;
%o A095318 for(i = 0, nB, if(bittest(x,i), b1++;, b0++;); );
%o A095318 if(b1 > (3+b0), return(1);, return(0););};
%o A095318 forprime(x = 2, 991, if(B(x), print1(x, ", "); ); );
%o A095318 \\ _Washington Bomfim_, Jan 12 2011
%Y A095318 Complement of A095319 in A000040. Subset of A095314. Subset: A095322. Cf. also A095328.
%K A095318 nonn,easy,base
%O A095318 1,1
%A A095318 _Antti Karttunen_, Jun 04 2004