id:A060227 - OEIS Search Results

Search: id:A060227

Displaying 1-1 of 1 results found.

page 1

a(n) = smallest m such that the letter "N" appears n times in the English phrase for m.

+0
1

1, 9, 19, 99, 119, 199, 999, 1199 (list; graph; listen)

	OFFSET	`0,2`
	REFERENCES	`Rodolfo Kurchan, Mesmerizing Math. Puzzles, Sterling Publications, page 19`
	EXAMPLE	`a(2)= 9 because Nine has 2 N's.`
	CROSSREFS	`Sequence in context: A046103 A041158 A000981 this_sequence A068174 A041677 A041160` `Adjacent sequences: A060224 A060225 A060226 this_sequence A060228 A060229 A060230`
	KEYWORD	`nonn,word`
	AUTHOR	`Rodolfo Kurchan (rkurchan(AT)yahoo.com), Mar 20 2001`

page 1

Search completed in 0.002 seconds

Last modified September 5 17:15 EDT 2008. Contains 143476 sequences.