The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A191784 Number of e's in the English name of the n-th odd number. 1

%I #19 Sep 08 2018 21:55:51

%S 1,2,1,2,1,3,2,2,4,3,2,3,2,3,2,1,2,1,2,1,1,2,1,2,1,1,2,1,2,1,1,2,1,2,

%T 1,3,4,3,4,3,2,3,2,3,2,2,3,2,3,2,3,4,3,4,3,5,4,4,6,5,4,5,4,5,4,3,4,3,

%U 4,3,3,4,3,4,3,3,4,3,4,3,3,4,3,4,3,5,6,5,6,5,4,5,4,5,4,4,5,4,5,4,2,3,2,3,2

%N Number of e's in the English name of the n-th odd number.

%C Every odd number has the letter e in its English name, so a(n) can never be 0.

%H Nathaniel Johnston, <a href="/A191784/b191784.txt">Table of n, a(n) for n = 1..5000</a>

%e a(5) = 1, because the 5th odd number is "nine", which contains one "e".

%p 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

%Y Cf. A085513.

%K dumb,easy,nonn,word

%O 1,2

%A _Kausthub Gudipati_, Jun 25 2011

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

Last modified June 12 13:39 EDT 2024. Contains 373331 sequences. (Running on oeis4.)