A060227 a(n) is the smallest number k such that the letter "N" appears n times when k is written in English.

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

Offset

1,2

References

Rodolfo Kurchan, Mesmerizing Math Puzzles, Sterling Publications, p. 19.

Links

Table of n, a(n) for n=1..31.

Example

a(2) = 9 because "NiNe" has 2 N's.

Crossrefs

Sequence in context: A259093 A186508 A000981 * A171066 A068174 A165247

Adjacent sequences: A060224 A060225 A060226 * A060228 A060229 A060230

Keyword

nonn,word

Author

Rodolfo Kurchan, Mar 20 2001

Extensions

Edited by Jon E. Schoenfield, Sep 29 2018

a(9)-a(19) from Sean A. Irvine, Oct 31 2022

a(20) and beyond from Michael S. Branicky, Nov 01 2022

Status

approved