login
The OEIS is supported by the many generous donors 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

%I #8 Oct 21 2018 13:51:01

%S 3,1,4,4,5,3,6,11,7,15,8,13,9,17,10,24,11,23,12,73,13,3000,14,11000,

%T 15,15000,16,101,17,104,18,103,19,111,20,115,21,113,22,117,23,124,24,

%U 123,25,173,26,323,27,373,28,1104,29,1103,30,1111,31

%N a(2n-1) = n+2, a(2n) = smallest number requiring n+2 letters in English.

%C Uses number forms containing "and"; that is, "one hundred and one" rather than "one hundred one". - _Sean A. Irvine_, Oct 20 2018

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

%K nonn,word,easy

%O 1,1

%A Jacques Haubrich (jhaubrich(AT)freeler.nl)

%E More terms from _Sean A. Irvine_, Oct 20 2018

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 00:26 EDT 2024. Contains 371264 sequences. (Running on oeis4.)