login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A113121 a(n) = smallest number of syllables necessary to communicate n by phone, in English. 0
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 3, 3, 3, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,8
COMMENTS
Without "and"; 0 spelled "O", like in "Five o'clock".
LINKS
The Math Forum, Ask Dr. Math.
EXAMPLE
a(11)=2 because "one-one" is shorter than "e-le-ven";
a(69)=2 because "six-nine" and not "six-ty-nine";
a(100)=2 because "hundred" and not "one-O-O"
CROSSREFS
Sequence in context: A079951 A095407 A038605 * A109036 A085031 A341974
KEYWORD
base,easy,nonn,word
AUTHOR
Alexandre Wajnberg, Jan 03 2006
STATUS
approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 01:01 EDT 2024. Contains 371696 sequences. (Running on oeis4.)