[seqfan] A "dumb" "word" sequence inspired by a few recent discussions.

[Andrew Weimholt]

Sequences of this type may not be of interest mathematically, but can
be fun to compute.

a(n) = the smallest number whose American English name contains n
distinct letters of the alphabet.

3 <= n <= 23

1, 0, 8, 13, 14, 25, 24, 74, 112, 127, 125, 165, 265, 1265, 2568, 12468,
1002568, 1001002568, 1000001001002568, 1000000001000001001002568,
1001000000001000001001002568

nonn, fini, full, word, dumb?

Cf. A050933

OEIS worthy?

Andrew

P.S.
Note: in American English it is not proper to use the word "and" in
the names of numbers.
WRONG: "one hundred and one"
RIGHT: "one hundred one"