OFFSET
1,1
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
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
MATHEMATICA
Select[Prime[Range[23000]], DigitCount[#, 2, 0]==1&] (* Harvey P. Dale, Nov 28 2019 *)
PROG
(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
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Antti Karttunen, Jun 01 2004
STATUS
approved