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 A095322 #13 Mar 04 2015 20:29:30
%S A095322 31,127,191,223,239,251,367,379,383,431,439,443,463,479,487,491,499,
%T A095322 503,509,751,863,887,983,991,1013,1019,1021,1151,1277,1279,1399,1439,
%U A095322 1471,1487,1499,1511,1523,1531,1663,1723,1759,1783,1787,1789,1823
%N A095322 Primes in whose binary expansion the number of 1 bits is > 4 + number of 0 bits.
%H A095322 A. Karttunen and J. Moyer: <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>
%t A095322 btsQ[n_]:=Module[{idn2=IntegerDigits[n,2]},Count[idn2,1]>4+Count[ idn2,0]]; Select[Prime[Range[300]],btsQ] (* _Harvey P. Dale_, Nov 12 2011 *)
%o A095322 (PARI) B(x) = { nB = floor(log(x)/log(2)); b1 = 0; b0 = 0;
%o A095322 for(i = 0, nB, if(bittest(x,i), b1++;, b0++;); );
%o A095322 if(b1 > (4+b0), return(1);, return(0););};
%o A095322 forprime(x = 2, 1823, if(B(x), print1(x, ", "); ); ); \\ _Washington Bomfim_, Jan 12 2011
%Y A095322 Complement of A095323 in A000040. Subset of A095318. Subset: A095284. Cf. also A095324.
%K A095322 nonn,easy
%O A095322 1,1
%A A095322 _Antti Karttunen_, Jun 04 2004