A095322 Primes in whose binary expansion the number of 1 bits is > 4 + number of 0 bits.

31, 127, 191, 223, 239, 251, 367, 379, 383, 431, 439, 443, 463, 479, 487, 491, 499, 503, 509, 751, 863, 887, 983, 991, 1013, 1019, 1021, 1151, 1277, 1279, 1399, 1439, 1471, 1487, 1499, 1511, 1523, 1531, 1663, 1723, 1759, 1783, 1787, 1789, 1823

Offset

1,1

Links

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

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

Mathematica

btsQ[n_]:=Module[{idn2=IntegerDigits[n, 2]}, Count[idn2, 1]>4+Count[ idn2, 0]]; Select[Prime[Range[300]], btsQ] (* Harvey P. Dale, Nov 12 2011 *)

Prog

(PARI) B(x) = { nB = floor(log(x)/log(2)); b1 = 0; b0 = 0;
for(i = 0, nB, if(bittest(x, i), b1++; , b0++; ); );
if(b1 > (4+b0), return(1); , return(0); ); };
forprime(x = 2, 1823, if(B(x), print1(x, ", "); ); ); \\ Washington Bomfim, Jan 12 2011

Crossrefs

Complement of A095323 in A000040. Subset of A095318. Subset: A095284. Cf. also A095324.

Sequence in context: A042888 A183836 A078656 * A127578 A333245 A158563

Adjacent sequences: A095319 A095320 A095321 * A095323 A095324 A095325

Keyword

nonn,easy

Author

Antti Karttunen, Jun 04 2004

Status

approved