|
%I #13 Dec 15 2018 20:44:35
%S 2,8,10,11,14,26,32,34,35,38,40,41,42,43,44,46,47,50,56,58,59,62,74,
%T 98,104,106,107,110,122,128,130,131,134,136,137,138,139,140,142,143,
%U 146,152,154,155,158,160,161,162,163,164,166,167,168,169,170,171
%N Let the binary expansion of n be n = Sum_{k} 2^{r_k}, let e(n) be the number of r_k's that are even, o(n) the number that are odd; sequence lists n such that e(n) < o(n).
%C e(n)+o(n) = A000120(n), the binary weight of n. For e(n) = o(n) see A039004.
%C Primes of this sequence are in A065049; but A065049 contains also other primes (see A152715). [_Vladimir Shevelev_, Dec 11 2008]
%t aQ[n_] := Module[{d = Reverse[IntegerDigits[n,2]]}, Total@d[[1;;-1;;2]] < Total@d[[2;;-1;;2]]]; Select[Range[180], aQ] (* _Amiram Eldar_, Dec 15 2018 *)
%o See link in A139351 for Fortran program.
%o (PARI) isok(n) = {my(irb = Vec(select(x->(x%2), Vecrev(binary(n)), 1))); #select(x->(x%2), irb) < #irb/2;} \\ _Michel Marcus_, Dec 15 2018
%Y Cf. A000120, A139351, A139352, A139353, A139354, A139355.
%Y Cf. A039004, A139371, A139372, A139373.
%K nonn
%O 1,1
%A _Nadia Heninger_ and _N. J. A. Sloane_, Jun 07 2008
|
