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 A368828 #28 Mar 29 2025 00:22:49
%S A368828 0,3,5,6,7,8,9,11,12,13,15,16,17,18,19,23,25,26,27,28,29,33,35,36,37,
%T A368828 38,39,40,53,55,56,57,58,59,63,65,66,67,68,69,73,75,76,77,78,79,83,85,
%U A368828 86,87,88,89,93,95,96,97,98,99,103,105,106,107,108,109,110,120,130,150,160,170,180,190,203,205,206,207
%N A368828 Numbers with the same number of zeros and letters O in their English name.
%H A368828 Michael S. Branicky, <a href="/A368828/b368828.txt">Table of n, a(n) for n = 1..10000</a>
%e A368828 0 = zerO (one 0 and one O), 3 = three (no 0 and no O), 5 = five (no 0 and no O), 6 = six (no 0 and no O), 7 = seven (no 0 and no O), etc.
%e A368828 1 is not in the sequence as (1 = One) is a contradiction, as are (2 = twO), (4 = fOur), (10 = ten), etc.
%t A368828 Select[Range[0,207], Count[IntegerDigits[#],0] == Count[Characters[IntegerName[#]], "o"]&] (* _Stefano Spezia_, Jan 07 2024 *)
%o A368828 (Python)
%o A368828 from num2words import num2words
%o A368828 def ok(n): return str(n).count('0') == num2words(n).count('o')
%o A368828 print([k for k in range(208) if ok(k)]) # _Michael S. Branicky_, Jan 07 2024
%Y A368828 Cf. A227857, A368829 (French name).
%K A368828 base,nonn,word
%O A368828 1,2
%A A368828 _Eric Angelini_, Jan 07 2024
%E A368828 a(36)-a(38) corrected by _Stefano Spezia_, Jan 07 2024