A095078 Primes with a single 0 bit in their binary expansion.

2, 5, 11, 13, 23, 29, 47, 59, 61, 191, 223, 239, 251, 383, 479, 503, 509, 991, 1019, 1021, 2039, 3583, 3967, 4079, 4091, 4093, 6143, 15359, 16127, 16319, 16381, 63487, 65407, 65519, 129023, 131063, 245759, 253951, 261631, 261887, 262079

Offset: 1

Author

Antti Karttunen, Jun 01 2004

Keywords

• nonn
• base
• easy

Comments

Except for the first value 2, the sequence gives the primes of the form 2^k -2^j -1 with 0 < j < k-1. If j=k-1 we obtain the Mersenne primes. - Pierre CAMI, May 19 2005

{2} UNION (A000040 INTERSECT A190620). - Chai Wah Wu, Dec 19 2024

Links

• T. D. Noe, 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

Intersection of A000040 and A030130. Cf. A095058, A190620.

Programs

Mathematica

Select[Prime[Range[23000]],DigitCount[#,2,0]==1&] (* Harvey P. Dale, Nov 28 2019 *)

PARI

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