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