login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A014388 a(2n-1) = n+2, a(2n) = smallest number requiring n+2 letters in English. 6
3, 1, 4, 4, 5, 3, 6, 11, 7, 15, 8, 13, 9, 17, 10, 24, 11, 23, 12, 73, 13, 3000, 14, 11000, 15, 15000, 16, 101, 17, 104, 18, 103, 19, 111, 20, 115, 21, 113, 22, 117, 23, 124, 24, 123, 25, 173, 26, 323, 27, 373, 28, 1104, 29, 1103, 30, 1111, 31 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Uses number forms containing "and"; that is, "one hundred and one" rather than "one hundred one". - Sean A. Irvine, Oct 20 2018

LINKS

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

CROSSREFS

Cf. A000916, A001166, A014388, A045494, A045495.

Sequence in context: A099813 A141300 A260502 * A186693 A117374 A202142

Adjacent sequences:  A014385 A014386 A014387 * A014389 A014390 A014391

KEYWORD

nonn,word,easy

AUTHOR

Jacques Haubrich (jhaubrich(AT)freeler.nl)

EXTENSIONS

More terms from Sean A. Irvine, Oct 20 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 22 17:29 EDT 2019. Contains 328319 sequences. (Running on oeis4.)