|
|
A060227
|
|
a(n) is the smallest number k such that the letter "N" appears n times when k is written in English.
|
|
0
|
|
|
1, 9, 19, 99, 119, 199, 999, 1199, 1999, 9999, 19999, 99999, 119999, 199999, 999999, 1199999, 1999999, 9999999, 19999999, 99999999, 119999999, 199999999, 999999999, 1199999999, 1999999999, 9999999999, 19999999999, 99999999999, 119999999999, 199999999999, 999999999999
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
REFERENCES
|
Rodolfo Kurchan, Mesmerizing Math Puzzles, Sterling Publications, p. 19.
|
|
LINKS
|
|
|
EXAMPLE
|
a(2) = 9 because "NiNe" has 2 N's.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,word
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|