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 A108580 #29 Sep 08 2022 08:45:19
%S A108580 10,11,30,31,100,101,102,103,110,111,120,121,200,201,210,211,220,221,
%T A108580 300,301,310,311,500,501,510,511,1000,1001,1002,1003,1004,1005,1006,
%U A108580 1007,1010,1011,1012,1013,1014,1015,1020,1021,1022,1023,1100,1101,1102,1103
%N A108580 Numbers whose sum of bits when written in binary > sum of decimal digits.
%C A108580 The sequence is infinite because 10^n, n = 1,2,3, .... are terms. - _Marius A. Burtea_, Sep 07 2019
%H A108580 Marius A. Burtea, <a href="/A108580/b108580.txt">Table of n, a(n) for n = 1..5000</a>
%e A108580 1103 is on the list since 1103 is 10001001111 (sum=6), 1+1+0+3=5.
%t A108580 Select[Range[1103], Total@IntegerDigits[#, 2] > Total@IntegerDigits[#, 10] &] (* _Amiram Eldar_, Sep 07 2019 *)
%o A108580 (PARI) isok(n) = hammingweight(n) > sumdigits(n); \\ _Michel Marcus_, Sep 07 2019
%o A108580 (Magma) [n:n in [1..1200]| &+Intseq(n,2) gt &+Intseq(n,10)]; // _Marius A. Burtea_, Sep 07 2019
%o A108580 (Python)
%o A108580 def ok(n): return sum(map(int, str(n))) < bin(n).count('1')
%o A108580 print(list(filter(ok, range(1104)))) # _Michael S. Branicky_, Oct 11 2021
%Y A108580 Subsequence of A325483.
%Y A108580 Cf. A000120, A007953, A037308.
%K A108580 nonn,base
%O A108580 1,1
%A A108580 _John L. Drost_, Jul 25 2005
%E A108580 a(36) added by _Marius A. Burtea_, Sep 07 2019