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 A356738 #6 Sep 04 2022 12:39:27
%S A356738 1,21,101,121,1101,1121,21121,101121,121121,1101121,1121121,21121121,
%T A356738 101121121,121121121,1101121121,1121121121,21121121121,121121121121,
%U A356738 1101121121121,1121121121121,21121121121121,101121121121121,121121121121121,1101121121121121
%N A356738 Smallest positive integer whose American English name consists of n words.
%F A356738 a(n) == 1 (mod 20).
%t A356738 name[n_]:=StringReplace[IntegerName[n,"Words"],{"-"->" ",", "->" "}];
%t A356738 nameLen[n_]:=WordCount[name[n]]; f[1]=1; f[n_]:=f[n]=Module[{k=f[n-1]},
%t A356738 While[nameLen[k]<n,k=k+20];k]; f/@Range[10]
%Y A356738 Cf. A080777.
%K A356738 nonn,word,fini
%O A356738 1,2
%A A356738 _Ivan N. Ianakiev_, Aug 25 2022