OFFSET
1,2
COMMENTS
Every odd number has the letter e in its English name, so a(n) can never be 0.
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 1..5000
EXAMPLE
a(5) = 1, because the 5th odd number is "nine", which contains one "e".
MAPLE
units:=[1, 0, 2, 0, 1, 0, 2, 1, 1, 1, 3, 2, 2, 2, 2, 2, 4, 3, 3]:tens:=[0, 0, 1, 0, 0, 0, 0, 2, 1, 1]: A191784 := proc(n) global tens, units: if(n<=10)then return units[2*n-1]: elif(n<=50)then return units[2*((n-1) mod 5) + 1] + tens[floor((n-1)/5)+1]: elif(n<=500)then return 1+units[floor((n-1)/50)]+procname(((n-1) mod 50) + 1): fi: return units[floor((n-1)/500)]+procname(((n-1) mod 500) + 1): end: seq(A191784(n), n=1..105); # valid up to n=5000, Nathaniel Johnston, Jun 26 2011
CROSSREFS
KEYWORD
dumb,easy,nonn,word
AUTHOR
Kausthub Gudipati, Jun 25 2011
STATUS
approved