|
| |
|
|
A095078
|
|
Primes with a single 0-bit in their binary expansion.
|
|
3
| |
|
|
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
(list; graph; refs; listen; history; internal format)
|
|
|
|
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 (pierre-cami(AT)bbox.fr), 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
|
|
|
PROG
| (PARI)forprime(p=2, 262079, v=binary(p); s=0; for(k=1, #v, s+=v[k]); if(#v-s==1, print1(p, ", "))) [W. Bomfim, Jan 13, 2011]
|
|
|
CROSSREFS
| Intersection of A000040 and A030130. Cf. A095058.
Sequence in context: A045361 A086081 A113305 * A062572 A106283 A020629
Adjacent sequences: A095075 A095076 A095077 * A095079 A095080 A095081
|
|
|
KEYWORD
| nonn,base,easy
|
|
|
AUTHOR
| Antti Karttunen (his-firstname.his-surname(AT)iki.fi), Jun 01 2004
|
| |
|
|
