|
%I
%S 5,19,71,83,89,101,113,271,283,307,313,331,397,409,419,421,433,457,
%T 1103,1117,1181,1223,1229,1237,1303,1307,1319,1381,1427,1429,1433,
%U 1481,1489,1559,1579,1607,1613,1619,1621,1637,1699,1733,1811,1861
%N Primes in whose binary expansion the number of 1-bits is one more than the number of 0-bits.
%H A. Karttunen and J. Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>
%t Select[Prime[Range[500]], Differences[DigitCount[#, 2]] == {-1} &]
%o (PARI)
%o { forprime(p=2, 2000,
%o v=binary(p); s=0;
%o for(k=1,#v, s+=if(v[k]==1,+1,-1));
%o if(s==1,print1(p,", "))
%o ) }
%Y Intersection of A000040 and A031448. Subset of A095070. Cf. A095053.
%K nonn,base,easy
%O 1,1
%A _Antti Karttunen_, Jun 01 2004
|
