|
%I #15 Mar 03 2015 00:39:50
%S 127,383,479,503,509,991,1019,1021,1279,1471,1531,1663,1759,1783,1787,
%T 1789,1951,1979,1999,2011,2027,2029,2039,3067,3581,3583,3823,3967,
%U 4027,4079,4091,4093,5087,5119,5503,5623,5879,6007,6011,6047
%N Primes in whose binary expansion the number of 1-bits is > 6 + number of 0-bits.
%H Harvey P. Dale, <a href="/A095312/b095312.txt">Table of n, a(n) for n = 1..10000</a>
%H A. Karttunen and J. Moyer: <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>
%t 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 *)
%o (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
%Y Complement of A095313 in A000040. Subset of A095284. Cf. also A095332.
%K nonn,base,easy
%O 1,1
%A _Antti Karttunen_, Jun 04 2004
|
