|
%I #12 Aug 31 2023 05:35:01
%S 0,1,3,4,5,6,7,9,12,13,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,
%T 31,33,36,37,39,45,48,49,51,52,53,54,55,57,60,61,63,64,65,66,67,68,69,
%U 70,71,72,73,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91
%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.
%H Amiram Eldar, <a href="/A139372/b139372.txt">Table of n, a(n) for n = 1..10000</a>
%t q[n_] := Module[{d = Reverse[IntegerDigits[n, 2]]}, Total@ d[[1;; -1;; 2]] >= Total@ d[[2;; -1;; 2]]]; Select[Range[0, 100], q] (* _Amiram Eldar_, Aug 31 2023 *)
%o See link in A139351 for Fortran program.
%Y Cf. A000120, A139351, A139352, A139353, A139354, A139355, A039004, A139370, A139371, A139373.
%K nonn,base
%O 1,3
%A _Nadia Heninger_ and _N. J. A. Sloane_, Jun 07 2008
|
