id:A113121 - OEIS Search Results

Search: id:A113121

Displaying 1-1 of 1 results found.

page 1

a(n) = smallest number of syllables necessary to communicate n by phone, in English.

+0
1

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; listen)

	OFFSET	`0,8`
	COMMENT	`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 this_sequence A109036 A085031 A029342` `Adjacent sequences: A113118 A113119 A113120 this_sequence A113122 A113123 A113124`
	KEYWORD	`base,easy,nonn,word`
	AUTHOR	`Alexandre Wajnberg (alexandre.wajnberg(AT)skynet.be), Jan 03 2006`

page 1

Search completed in 0.005 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research