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 A359534 #25 Oct 19 2023 23:32:33
%S A359534 2000008,2000080,2000082,2000083,2000084,2000085,2000086,2000087,
%T A359534 2000088,2000089,2000800,2000802,2000803,2000804,2000805,2000806,
%U A359534 2000807,2000808,2000809,2000820,2000822,2000823,2000824,2000825,2000826,2000827,2000828,2000829,2000830,2000832,2000833,2000834,2000835,2000836,2000837,2000838
%N A359534 Numbers that don’t have a 1 and yet have one.
%e A359534 The first three terms are 2000008, 2000080 and 2000082 where no digit 1 is present, and yet we can read the substring ONE when those numbers are written in English: two milli(ON E)ight, two milli(ON E)ighty, two milli(ON E)ighty two, etc.
%e A359534 We cannot use Eleven after milliON, nor Eighteen, as this would produce at least one digit 1.
%t A359534 Select[Range[#, # + 1000] &[2*10^6], And[StringContainsQ[StringJoin@ DeleteCases[Characters@ IntegerName[#, "Words"], _?(! LetterQ[#] &)], "one"], DigitCount[#, 10, 1] == 0] &] (* _Michael De Vlieger_, Oct 15 2023 *)
%o A359534 (Python)
%o A359534 from num2words import num2words
%o A359534 def n2w(n): return num2words(n).replace(" and","").replace(chr(44),"").replace("-","").replace(" ","")
%o A359534 def ok(n): return "1" not in str(n) and "one" in n2w(n)
%o A359534 print([k for k in range(2000840) if ok(k)]) # _Michael S. Branicky_, Oct 15 2023
%Y A359534 Cf. A052383, A345711.
%K A359534 base,nonn,word
%O A359534 1,1
%A A359534 _Eric Angelini_, Oct 15 2023