A095316 Primes in whose binary expansion the number of 1-bits is > number of 0-bits minus 2.

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 263, 269, 271, 277, 281

Offset: 1

Author

Antti Karttunen, Jun 04 2004

Keywords

• nonn
• base
• easy

Comments

Differs from primes (A000040) first time at n=32, where a(32)=139, while A000040(32)=131, as 131 whose binary expansion is 10000011, with 3 1-bits and 5 0-bits is the first prime excluded from this sequence.

Links

• Harvey P. Dale, Table of n, a(n) for n = 1..1000
• A. Karttunen and J. Moyer: C-program for computing the initial terms of this sequence

Crossrefs

Complement of A095317 in A000040. Subset of A095320. Subset: A095074. Cf. also A095326.

Programs

Mathematica

Select[Prime[Range[60]],DigitCount[#,2,1]>(DigitCount[#,2,0]-2)&] (* Harvey P. Dale, May 28 2012 *)

PARI

forprime(p=2,281,v=binary(p);s=0;for(k=1,#v,s+=if(v[k]==1,+1,-1));if(s>-2,print1(p,", "))) \\ Washington Bomfim, Jan 13 2011