OFFSET
1,1
COMMENTS
Each of the 26 letters of the (English) alphabet, encoded via a->1, b->2, ... , z->26, appears a(n) times in the string of all the (English) names of the twelve months of the year. The letters are taken case insensitive.
FORMULA
a(n) = number of times the letter with standard code n (for the code see a comment above), appears in all the twelve English names for the months of the year.
EXAMPLE
a(1) = 7 because the first letter 'a' (or 'A') of the English alphabet appears in 'January' twice, in 'February' once, in 'March' once, in 'April' once, in 'May' once and once in 'August'.
a(5) = 11 = 0 + 1 + 0 + 0 + 0 + 1 + 0 + 0 + 3 + 1 + 2 + 3.
a(11) = 0 because there is no 'k' or 'K' in the name of the months in English.
CROSSREFS
KEYWORD
nonn,word,fini,full
AUTHOR
Wolfdieter Lang, Dec 14 2012
STATUS
approved