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 A095320 #14 Mar 02 2015 02:37:38 %S A095320 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89, %T A095320 97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179, %U A095320 181,191,193,197,199,211,223,227,229,233,239,241,251,263,269 %N A095320 Primes in whose binary expansion the number of 1-bits is > number of 0-bits minus 3. %C A095320 Differs from primes (A000040) first time at n=55, where a(55)=263, while A000040(55)=257, as 257 whose binary expansion is 100000001, with 2 1-bits and 7 0-bits is the first prime excluded from this sequence. Note that 129 (10000001 in binary, 2 1-bits and 6 0-bits) is not prime. %H A095320 A. Karttunen and J. Moyer: <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a> %t A095320 Select[Prime[Range[60]],DigitCount[#,2,1]>DigitCount[#,2,0]-3&] (* _Harvey P. Dale_, Jul 24 2013 *) %o A095320 (PARI)forprime(p=2,269,v=binary(p);s=0;for(k=1,#v, s+=if(v[k]==1,+1,-1));if(s>-3,print1(p,", "))) \\ _Washington Bomfim_, Jan 13 2011 %Y A095320 Complement of A095321 in A000040. Subset: A095316. %Y A095320 Cf. A095330. %K A095320 nonn,base,easy %O A095320 1,1 %A A095320 _Antti Karttunen_, Jun 04 2004