OFFSET
1,1
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..10000
EXAMPLE
THREE has two Es (and is thus in the sequence), FOUR has no E, FIVE has only one, SIX has none, SEVEN has two Es (and is thus in the sequence). Etc.
PROG
(Python)
from num2words import num2words
def ok(n): return num2words(n).count("e") == 2
print([k for k in range(311) if ok(k)]) # Michael S. Branicky, Feb 19 2022
CROSSREFS
KEYWORD
word,nonn
AUTHOR
Eric Angelini, Dec 04 2021
EXTENSIONS
a(7) = 16 inserted by Michael S. Branicky, Feb 19 2022
STATUS
approved