|
|
A102082
|
|
Number of times the n-th letter in an infinitely repeating English alphabet appears in the US English name for the number n.
|
|
1
|
|
|
0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 2, 0, 0, 0, 0, 0, 2, 0, 0, 2, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 2, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 3, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,21
|
|
LINKS
|
|
|
EXAMPLE
|
a(5) = 1 since letter 5 = e appears once in "five".
a(20) = 2 since letter 20 = t appears twice in "twenty".
a(34) = 1 since letter 34 = h appears once in "thirty four".
a(105) = 0 since letter 105 = a does not appear in "one hundred five".
a,b,c,... z, a, b, ... .
1,2,3,...26,27,28, ... .
|
|
PROG
|
(Python)
from num2words import num2words
def a(n): return num2words(n).replace(" and", "").count(chr(96+n%26))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,word
|
|
AUTHOR
|
Jeremy Ballard (gtg056b(AT)prism.gatech.edu), Feb 13 2005
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|