A095317 Primes in whose binary expansion the number of 1 bits is <= number of 0 bits minus 2.

131, 137, 193, 257, 521, 523, 547, 577, 593, 641, 643, 673, 769, 773, 1031, 1033, 1049, 1061, 1091, 1093, 1097, 1153, 1217, 1283, 1289, 1297, 1409, 1553, 1601, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2113, 2129, 2131, 2137, 2153

Offset

1,1

Links

Harvey P. Dale, 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[400]], DigitCount[#, 2, 1]<=DigitCount[#, 2, 0]-2&] (* Harvey P. Dale, Dec 10 2017 *)

Prog

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

Crossrefs

Complement of A095316 in A000040. Subset: A095321. Subset of A095071. Cf. also A095327.

Sequence in context: A145096 A210498 A050671 * A357075 A116519 A139646

Adjacent sequences: A095314 A095315 A095316 * A095318 A095319 A095320

Keyword

nonn,base,easy

Author

Antti Karttunen, Jun 04 2004

Status

approved