A095312 Primes in whose binary expansion the number of 1-bits is > 6 + number of 0-bits.

127, 383, 479, 503, 509, 991, 1019, 1021, 1279, 1471, 1531, 1663, 1759, 1783, 1787, 1789, 1951, 1979, 1999, 2011, 2027, 2029, 2039, 3067, 3581, 3583, 3823, 3967, 4027, 4079, 4091, 4093, 5087, 5119, 5503, 5623, 5879, 6007, 6011, 6047

Offset

1,1

Links

Harvey P. Dale, Table of n, a(n) for n = 1..10000

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

Mathematica

n1bQ[n_]:=Module[{idn2=IntegerDigits[n, 2]}, Count[idn2, 1]>6+Count[idn2, 0]]; Select[Prime[Range[1000]], n1bQ] (* Harvey P. Dale, Jun 25 2014 *)

Prog

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

Crossrefs

Complement of A095313 in A000040. Subset of A095284. Cf. also A095332.

Sequence in context: A112419 A142201 A142889 * A143034 A159521 A122691

Adjacent sequences: A095309 A095310 A095311 * A095313 A095314 A095315

Keyword

nonn,base,easy

Author

Antti Karttunen, Jun 04 2004

Status

approved