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 A052363 #33 Feb 16 2025 08:32:41 %S A052363 0,3,11,13,17,23,73,101,103,111,113,117,123,173,323,373,1103,1111, %T A052363 1113,1117,1123,1173,1323,1373,3323,3373,11373,13323,13373,17373, %U A052363 23323,23373,73373,101373,103323,103373,111373,113323,113373,117373,123323,123373,173373,323373,373373 %N A052363 Numbers n whose English name has a greater length (A005589) than any smaller number. %C A052363 Indices of records in A005589 (which only counts letters, but not spaces and punctuation, in the English name of numbers). %H A052363 Michael S. Branicky, <a href="/A052363/b052363.txt">Table of n, a(n) for n = 1..597</a> (terms < 10^54) %H A052363 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Number.html">Number</a> %H A052363 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/LargeNumber.html">Large Number</a> %H A052363 Wikipedia, <a href="https://en.wikipedia.org/wiki/Names_of_large_numbers">Names of Large Numbers</a> %H A052363 Wiktionary, <a href="https://en.wiktionary.org/wiki/one_hundred_one">one hundred one</a> (US) %H A052363 Wiktionary, <a href="https://en.wiktionary.org/wiki/one_hundred_and_one">one hundred and one</a> (UK) %H A052363 Robert G. Wilson v, <a href="https://oeis.org/A001477/a001477.txt">American English names for the numbers from 0 to 100999 without spaces or hyphens</a> %e A052363 Note that A052360(373373) = 64 and A005589(373373) = 56. %e A052363 Sequence A052362 uses A052360 which also counts spaces and dashes, therefore "twenty-one" is in that sequence but not in this one: it uses one more character ('-') but has the same number of letters than "seventeen". - _M. F. Hasler_, Aug 12 2020 %o A052363 (PARI) m=0; for(n=0, 2e6, if(m<A005589(n), m=A005589(n); print1(n", "))) \\ _M. F. Hasler_, Aug 12 2020 %o A052363 (Python) %o A052363 from itertools import count, islice %o A052363 from num2words import num2words as n2w %o A052363 def f(n): return sum(1 for c in n2w(n).replace(" and", "") if c.isalpha()) %o A052363 def agen(): %o A052363 record = 0 %o A052363 for n in count(0): %o A052363 value = f(n) %o A052363 if value > record: yield n; record = value %o A052363 n += 1 %o A052363 print(list(islice(agen(), 40))) # _Michael S. Branicky_, Jul 12 2022 %Y A052363 Cf. A005589, A052360, A052362. %K A052363 nonn,word %O A052363 1,2 %A A052363 _Allan C. Wechsler_, Mar 07 2000 %E A052363 Edited by _R. J. Mathar_ and _T. D. Noe_, Apr 09 2009 %E A052363 Minor edits by _Ray Chandler_, Jul 22 2009 %E A052363 a(41) and beyond from _Michael S. Branicky_, Jul 12 2022