|
%I #18 Nov 28 2019 14:46:34
%S 2,5,11,13,23,29,47,59,61,191,223,239,251,383,479,503,509,991,1019,
%T 1021,2039,3583,3967,4079,4091,4093,6143,15359,16127,16319,16381,
%U 63487,65407,65519,129023,131063,245759,253951,261631,261887,262079
%N Primes with a single 0 bit in their binary expansion.
%C 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
%H T. D. Noe, <a href="/A095078/b095078.txt">Table of n, a(n) for n=1..1000</a>
%H A. Karttunen and J. Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>
%t Select[Prime[Range[23000]],DigitCount[#,2,0]==1&] (* _Harvey P. Dale_, Nov 28 2019 *)
%o (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
%Y Intersection of A000040 and A030130. Cf. A095058.
%K nonn,base,easy
%O 1,1
%A _Antti Karttunen_, Jun 01 2004
|
