login
A356738
Smallest positive integer whose American English name consists of n words.
0
1, 21, 101, 121, 1101, 1121, 21121, 101121, 121121, 1101121, 1121121, 21121121, 101121121, 121121121, 1101121121, 1121121121, 21121121121, 121121121121, 1101121121121, 1121121121121, 21121121121121, 101121121121121, 121121121121121, 1101121121121121
OFFSET
1,2
FORMULA
a(n) == 1 (mod 20).
MATHEMATICA
name[n_]:=StringReplace[IntegerName[n, "Words"], {"-"->" ", ", "->" "}];
nameLen[n_]:=WordCount[name[n]]; f[1]=1; f[n_]:=f[n]=Module[{k=f[n-1]},
While[nameLen[k]<n, k=k+20]; k]; f/@Range[10]
CROSSREFS
Cf. A080777.
Sequence in context: A267681 A126408 A157329 * A044272 A044653 A076454
KEYWORD
nonn,word,fini
AUTHOR
Ivan N. Ianakiev, Aug 25 2022
STATUS
approved