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 A352546 #18 Nov 28 2024 15:12:43
%S A352546 0,2,4,6,8,20,22,24,26,28,40,42,44,46,48,60,62,64,66,68,80,82,84,86,
%T A352546 88,100,102,104,106,108,120,122,124,126,128,140,142,144,146,148,160,
%U A352546 162,164,166,168,180,182,184,186,188,200,201,202,203,204,205,206,207,208,209,210,212
%N A352546 Numbers having more even than odd digits when written in base 10.
%H A352546 Paolo Xausa, <a href="/A352546/b352546.txt">Table of n, a(n) for n = 1..10000</a>
%t A352546 A352546Q[k_] := Length[#] > 2*Count[#, _?OddQ] & [IntegerDigits[k]];
%t A352546 Select[Range[0, 300], A352546Q] (* _Paolo Xausa_, Nov 28 2024 *)
%o A352546 (PARI) select( {is_A352546(n)=vecsum(n=digits(n)%2)*2<#n+!n}, [0..222])
%o A352546 (Python)
%o A352546 def ok(n): return len(s:=str(n)) < 2*sum(1 for c in s if c in "02468")
%o A352546 print([k for k in range(213) if ok(k)]) # _Michael S. Branicky_, Jul 03 2022
%Y A352546 Cf. A196563, A196564.
%Y A352546 Cf. A072603 (same in base 2).
%Y A352546 Cf. A117076 (subsequence of primes).
%Y A352546 Cf. A352547 (numbers having more odd than even decimal digits).
%K A352546 nonn,base
%O A352546 1,2
%A A352546 _M. F. Hasler_, Jul 03 2022