|
| |
|
|
A095320
|
|
Primes in whose binary expansion the number of 1-bits is > number of 0-bits minus 3.
|
|
3
| |
|
|
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, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 263, 269
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Differs from primes (A000040) first time at n=55, where a(55)=263, while A000040(55)=257, as 257 whose binary expansion is 100000001, with 2 1-bits and 7 0-bits is the first prime excluded from this sequence. Note that 129 (10000001 in binary, 2 1-bits and 6 0-bits) is not prime.
|
|
|
LINKS
| A. Karttunen and J. Moyer: C-program for computing the initial terms of this sequence
|
|
|
PROG
| (PARI)forprime(p=2, 269, v=binary(p); s=0; for(k=1, #v, s+=if(v[k]==1, +1, -1)); if(s>-3, print1(p, ", "))) [W. Bomfim, Jan 13, 2011]
|
|
|
CROSSREFS
| Complement of A095321 in A000040. Subset: A095316. Cf. A095330.
Sequence in context: A100726 A015919 A064555 * A077359 A057448 A049551
Adjacent sequences: A095317 A095318 A095319 * A095321 A095322 A095323
|
|
|
KEYWORD
| nonn,base,easy
|
|
|
AUTHOR
| Antti Karttunen (his-firstname.his-surname(AT)iki.fi), Jun 04 2004
|
| |
|
|
