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

 

Logo


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

1,2

COMMENTS

Requires presence of "and" at appropriate place, e.g. "one hundred and one" [Sean A. Irvine, Aug 29, 2011].

LINKS

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

CROSSREFS

Cf. A001166, A014388, A045494, A045495.

Sequence in context: A222290 A222430 A222275 * A323846 A014241 A199185

Adjacent sequences:  A000913 A000914 A000915 * A000917 A000918 A000919

KEYWORD

nonn,word,easy

AUTHOR

Jacques Haubrich (jhaubrich(AT)freeler.nl)

EXTENSIONS

More terms from Sean A. Irvine, Aug 28 2011

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 November 22 13:47 EST 2019. Contains 329393 sequences. (Running on oeis4.)