Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060227
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060227 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: A041158 A146080 A000981 this_sequence A068174 A165247 A041677

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

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 19 21:04 EST 2009. Contains 171054 sequences.


AT&T Labs Research