This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A139371 #13 Dec 19 2024 11:41:30
%S A139371 0,2,3,6,8,9,10,11,12,14,15,18,24,26,27,30,32,33,34,35,36,38,39,40,41,
%T A139371 42,43,44,45,46,47,48,50,51,54,56,57,58,59,60,62,63,66,72,74,75,78,90,
%U A139371 96,98,99,102,104,105,106,107,108,110,111,114,120,122,123,126
%N A139371 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 A139371 e(n)+o(n) = A000120(n), the binary weight of n. For e(n) = o(n) see A039004.
%H A139371 Amiram Eldar, <a href="/A139371/b139371.txt">Table of n, a(n) for n = 1..10000</a>
%t A139371 q[n_] := Module[{d = Reverse[IntegerDigits[n, 2]]}, Total@ d[[1;; -1;; 2]] <= Total@ d[[2;; -1;; 2]]]; Select[Range[0, 130], q] (* _Amiram Eldar_, Aug 31 2023 *)
%o A139371 (Fortran) c See link in A139351
%Y A139371 Cf. A000120, A139351, A139352, A139353, A139354, A139355, A039004, A139370, A139372, A139373.
%K A139371 nonn,base
%O A139371 1,2
%A A139371 _Nadia Heninger_ and _N. J. A. Sloane_, Jun 07 2008