Contributions to The On-Line Encyclopedia of Integer Sequences A361746

 I'm making this post to have a place to go to quickly reference OEIS sequences that I have authored.

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

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 (list; graph; refs; listen; history; edit; text; internal format)

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