OFFSET
1,2
MATHEMATICA
name[n_]:=IntegerName[n, "Words"]; a[1]=1; a[n_]:=a[n]=Module[{i=a[n-1]+1}, While[
StringContainsQ[name[i], StringTake[name[a[n-1]], 1]], i++ ]; i]; a/@Range[12]
PROG
(Python)
from num2words import num2words
def n2w(n): return num2words(n).replace(" and", "")
def afind(limit):
alst, aset = [1], {1}
print(1, end=", ")
while alst[-1] < limit:
an = alst[-1] + 1
avoid = n2w(alst[-1])[0]
while an in aset or avoid in n2w(an): an += 1
alst.append(an); aset.add(an)
print(an, end=", ")
afind(100000) # Michael S. Branicky, Dec 20 2021
CROSSREFS
KEYWORD
nonn,word,fini,full
AUTHOR
Ivan N. Ianakiev, Dec 20 2021
STATUS
approved