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 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

CROSSREFS

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

Sequence in context: A125608 A099813 A141300 * A186693 A117374 A202142

Adjacent sequences:  A014385 A014386 A014387 * A014389 A014390 A014391

KEYWORD

nonn,word,easy

AUTHOR

Jacques Haubrich (jhaubrich(AT)freeler.nl)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 04:48 EST 2012. Contains 205570 sequences.