A095318 Primes in whose binary expansion the number of 1 bits is > 3 + number of 0 bits.

31, 47, 59, 61, 127, 191, 223, 239, 251, 367, 379, 383, 431, 439, 443, 463, 479, 487, 491, 499, 503, 509, 607, 631, 701, 719, 727, 733, 743, 751, 757, 761, 823, 827, 829, 859, 863, 877, 883, 887, 911, 919, 941, 947, 953, 967, 971, 983, 991

Offset: 1

Author

Antti Karttunen, Jun 04 2004

Keywords

• nonn
• easy
• base

Links

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

Crossrefs

Complement of A095319 in A000040. Subset of A095314. Subset: A095322. Cf. also A095328.

Programs

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 > (3+b0), return(1);, return(0););};
forprime(x = 2, 991, if(B(x), print1(x, ", "); ); );
\\ Washington Bomfim, Jan 12 2011