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 A352547 #17 Nov 28 2024 15:13:41
%S A352547 1,3,5,7,9,11,13,15,17,19,31,33,35,37,39,51,53,55,57,59,71,73,75,77,
%T A352547 79,91,93,95,97,99,101,103,105,107,109,110,111,112,113,114,115,116,
%U A352547 117,118,119,121,123,125,127,129,130,131,132,133,134,135,136,137,138,139,141,143,145,147,149,150,151,152,153,154,155
%N A352547 Numbers having more odd than even digits when written in base 10.
%H A352547 Paolo Xausa, <a href="/A352547/b352547.txt">Table of n, a(n) for n = 1..10000</a>
%t A352547 A352547Q[k_] := Length[#] < 2*Count[#, _?OddQ] &[IntegerDigits[k]];
%t A352547 Select[Range[300], A352547Q] (* _Paolo Xausa_, Nov 28 2024 *)
%o A352547 (PARI) select( {is_A352547(n)=vecsum(n=digits(n)%2)*2>#n}, [0..155])
%o A352547 (Python)
%o A352547 def ok(n): return len(s:=str(n)) > 2*sum(1 for c in s if c in "02468")
%o A352547 print([k for k in range(156) if ok(k)]) # _Michael S. Branicky_, Jul 03 2022
%Y A352547 Cf. A196563, A196564.
%Y A352547 Cf. A072600 (same in base 2).
%Y A352547 Cf. A227870, A352546 (numbers with fewer odd than even decimal digits).
%K A352547 nonn,base
%O A352547 1,2
%A A352547 _M. F. Hasler_, Jul 03 2022