A095321 Primes in whose binary expansion the number of 1-bits is <= number of 0-bits minus 3.

257, 521, 577, 641, 769, 1031, 1033, 1049, 1061, 1091, 1093, 1097, 1153, 1217, 1283, 1289, 1297, 1409, 1553, 1601, 2053, 2069, 2081, 2083, 2089, 2113, 2129, 2179, 2309, 2593, 2689, 3089, 3137, 3329, 4099, 4111, 4129, 4133, 4139, 4153

Offset

1,1

Links

Table of n, a(n) for n=1..40.

A. Karttunen and J. Moyer: C-program for computing the initial terms of this sequence

Mathematica

Select[Prime[Range[600]], DigitCount[#, 2, 1]<=DigitCount[#, 2, 0]-3&] (* Harvey P. Dale, Jul 04 2018 *)

Prog

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

Crossrefs

Complement of A095320 in A000040. Subset of A095317. Cf. also A095331.

Sequence in context: A340343 A158231 A070815 * A100633 A007765 A250726

Adjacent sequences: A095318 A095319 A095320 * A095322 A095323 A095324

Keyword

nonn,base,easy

Author

Antti Karttunen, Jun 04 2004

Status

approved