login
This site is supported by donations 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; 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 A029342

Adjacent sequences:  A113118 A113119 A113120 * A113122 A113123 A113124

KEYWORD

base,easy,nonn,word

AUTHOR

Alexandre Wajnberg (alexandre.wajnberg(AT)skynet.be), Jan 03 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 01:31 EST 2012. Contains 205860 sequences.