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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A231072 Number of words in English spelling of n. 1
 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,22 COMMENTS From a(101) on it must be made precise that this sequence uses the American style ("one hundred one"), as in A052360, and not the British style ("one hundred and one"). The choice of long or short scale does not make a difference since, e.g., the word "milliard" in long scale use would simply be replaced by "billion" in short scale. However, the use of "thousand [million]" instead, would lead to different results for numbers such that floor(n/10^6) mod 10^3 is zero. - M. F. Hasler, Nov 03 2013 LINKS EXAMPLE From "zero" to "twenty", the numbers are written in one word, so a(0..20)=1. "Twenty-one" is the first term to require 2 words, so a(21)=2. PROG (PARI) a(n)=sum(k=7, #n=Vecsmall(English(n)), n[k-3]<65)+1 \\ See A052360 for English(). Only characters 4, ..., length-4 need to be checked for space/hyphen since there is no word with less than 3 letters. CROSSREFS Cf. A001167, A075774, A052360. Sequence in context: A063056 A174835 A297036 * A055640 A098378 A160093 Adjacent sequences:  A231069 A231070 A231071 * A231073 A231074 A231075 KEYWORD nonn,word,easy AUTHOR M. F. Hasler, Nov 03 2013 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 July 25 09:49 EDT 2021. Contains 346289 sequences. (Running on oeis4.)