A361746 - OEIS

%I #22 Mar 26 2023 11:33:29

%S 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,

%T 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,

%U 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

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

%e For n = 3, a(3) = 2 because the letter e occurs twice in the word "three".

%e For n = 4, a(4) = 1 because the letters f, o, u and r each occur once in the word "four".

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

%o (Python)

%o from num2words import num2words

%o from collections import Counter

%o def a(n): return max(Counter(num2words(n).replace(" and", "").replace(" ", "")).values())

%o print([a(n) for n in range(112)]) # _Michael S. Branicky_, Mar 24 2023

%Y Cf. A005589.

%K easy,nonn,word,less

%O 0,4

%A _James C. McMahon_, Mar 22 2023