A361746 Number of occurrences of the most frequently occurring letter(s) in US English name of n.

1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 2, 2, 2, 4, 3, 3, 2, 2, 3, 3, 2, 2, 2, 3, 3, 3, 2, 2, 3, 3, 2, 2, 2, 2, 3, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 1, 1, 2, 2, 1, 2, 2, 2, 2, 2, 2, 3, 2, 4, 2, 3, 2, 4, 3, 3, 1, 2, 2, 3, 1, 2, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 4, 2

Offset

0,4

Links

Table of n, a(n) for n=0..100.

Example

For n = 3, a(3) = 2 because the letter e occurs twice in the word "three".
For n = 4, a(4) = 1 because the letters f, o, u and r each occur once in the word "four".

Mathematica

a[n_] := Max[Values[LetterCounts[IntegerName[n, "Words"]]]]; Array[a, 100, 0] (* Amiram Eldar, Mar 24 2023 *)

Prog

(Python)
from num2words import num2words
from collections import Counter
def a(n): return max(Counter(num2words(n).replace(" and", "").replace(" ", "")).values())
print([a(n) for n in range(112)]) # Michael S. Branicky, Mar 24 2023

Crossrefs

Cf. A005589.

Sequence in context: A156775 A064693 A325614 * A369917 A319608 A230850

Adjacent sequences: A361743 A361744 A361745 * A361747 A361748 A361749

Keyword

easy,nonn,word,less

Author

James C. McMahon, Mar 22 2023

Status

approved