The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A219242 Distribution of letters in the name of all months of the year (English). 0
 7, 5, 3, 1, 11, 1, 1, 1, 1, 3, 0, 2, 5, 3, 3, 2, 0, 9, 2, 3, 6, 1, 0, 0, 4, 0 (list; graph; refs; listen; history; text; internal format)
 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. LINKS 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 Cf. A219241 (analog for days of the week). Sequence in context: A320158 A085927 A180597 * A330920 A155816 A308414 Adjacent sequences:  A219239 A219240 A219241 * A219243 A219244 A219245 KEYWORD nonn,word,fini,full AUTHOR Wolfdieter Lang, Dec 14 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 2 03:22 EST 2020. Contains 338865 sequences. (Running on oeis4.)