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 A072603 #25 Feb 26 2023 16:39:06
%S A072603 4,8,16,17,18,20,24,32,33,34,36,40,48,64,65,66,67,68,69,70,72,73,74,
%T A072603 76,80,81,82,84,88,96,97,98,100,104,112,128,129,130,131,132,133,134,
%U A072603 136,137,138,140,144,145,146,148,152,160,161,162,164,168,176,192,193
%N A072603 Numbers which in base 2 have more 0's than 1's.
%H A072603 T. D. Noe, <a href="/A072603/b072603.txt">Table of n, a(n) for n = 1..5202</a> (numbers up to 2^14)
%H A072603 Jason Bell, Thomas Finn Lidbetter, Jeffrey Shallit, <a href="https://arxiv.org/abs/1804.07996">Additive Number Theory via Approximation by Regular Languages</a>, arXiv:1804.07996 [cs.FL], 2018.
%H A072603 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%e A072603 8 is present because '1000' contains 3 '0's and 1 '1': 3>1.
%t A072603 gtQ[n_] := Module[{a, b}, {a, b} = DigitCount[n, 2]; b > a]; Select[Range[2^8], gtQ] (* _T. D. Noe_, Apr 20 2013 *)
%t A072603 Select[Range[200],DigitCount[#,2,0]>DigitCount[#,2,1]&] (* _Harvey P. Dale_, Feb 26 2023 *)
%o A072603 (Haskell)
%o A072603 a072603 n = a072603_list !! (n-1)
%o A072603 a072603_list = filter ((> 0) . a037861) [1..]
%o A072603 -- _Reinhard Zumkeller_, Mar 31 2015
%o A072603 (PARI) is(n)=2*hammingweight(n)<exponent(n)+1 \\ _Charles R Greathouse IV_, Apr 18 2020
%Y A072603 Cf. A007088, A000120, A023416, A072600, A072601, A031443, A072602.
%Y A072603 Cf. A037861(a(n)) > 0.
%K A072603 nonn,base,easy
%O A072603 1,1
%A A072603 _Reinhard Zumkeller_, Jun 23 2002