cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A349888 Numbers which, when written in English, contain exactly two instances of the letter E.

Original entry on oeis.org

3, 7, 12, 13, 14, 15, 16, 21, 25, 28, 29, 33, 37, 43, 47, 53, 57, 63, 67, 70, 72, 74, 76, 81, 85, 88, 89, 91, 95, 98, 99, 100, 102, 104, 106, 130, 132, 134, 136, 140, 142, 144, 146, 150, 152, 154, 156, 160, 162, 164, 166, 201, 205, 208, 209, 210, 220, 222, 224, 226, 231, 235, 238, 239
Offset: 1

Views

Author

Eric Angelini, Dec 04 2021

Keywords

Examples

			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.
		

Crossrefs

Cf. A006933 ('Eban' numbers) and A349887 (exactly one instance).

Programs

  • 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

Extensions

a(7) = 16 inserted by Michael S. Branicky, Feb 19 2022

A351799 Numbers which, when written in French, contain exactly one instance of the letter E.

Original entry on oeis.org

0, 2, 4, 7, 9, 11, 12, 14, 15, 17, 19, 21, 22, 24, 27, 29, 40, 43, 45, 46, 48, 50, 53, 55, 56, 58, 60, 63, 65, 66, 68, 70, 78, 80, 81, 83, 85, 86, 88, 90, 98, 100, 101, 103, 105, 106, 108, 110, 118, 120, 123, 125, 126, 128, 300, 301, 303, 305, 306, 308, 310
Offset: 1

Views

Author

Carole Dubois and Eric Angelini, Feb 19 2022

Keywords

Comments

ZERO(0) has one E (and is thus in the sequence), UN(1) has no E, DEUX(2) has one, TROIS(3) has none, QUATRE(4) has one E (and is thus in the sequence). etc.

Crossrefs

Cf. A006933 ('Eban' numbers), A349887 (exactly one instance in English), A349888 (exactly two instances in English),

Programs

  • Python
    from num2words import num2words
    from unidecode import unidecode
    def ok(n): return unidecode(num2words(n, lang='fr')).count("e") == 1
    print([k for k in range(311) if ok(k)]) # Michael S. Branicky, Feb 19 2022
Showing 1-2 of 2 results.