This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A233185 a(n) is the least number larger than the total number of letters in the French names for all terms up to and including a(n). 5
 5, 9, 15, 20, 29, 39, 50, 60, 68, 80, 96, 100, 108, 119, 130, 145, 160, 175, 196, 206, 220, 236, 256, 279, 300, 301, 315, 330, 350, 369, 395, 409, 428, 450, 469, 496, 506, 520, 536, 556, 579, 600, 601, 606, 620, 635, 655, 676, 700, 701, 706, 720, 736, 756, 776, 800, 801, 806, 820, 836, 856, 879, 900, 901, 910, 926, 945, 965, 988 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS French version of A233184. See A233186 for a variant using weak inequality, "not smaller" instead of "larger", in the definition. In the English case this would only affect the first 4 terms, but not so in the French version. See See A233187-A233188 for German variants. LINKS E. Angelini, Cumulative quantity of letters used in a list of English number-names, SeqFan list, Dec 05 2013 EXAMPLE The total length up to a(n), followed by the name of a(n), is as follows: 4 (cinq), 8 (neuf), 14 (quinze), 19 (vingt), 28 (vingt-neuf), 38 (trente-neuf), 47 (cinquante), 55 (soixante), 67 (soixante-huit), 79 (quatre-vingts), 95 (quatre-vingt-seize), 99 (cent), 107 (cent huit), 118 (cent dix-neuf), 128 (cent trente), 144 (cent quarante-cinq), ... PROG (PARI) a=0; k=0; for(n=1, 99, until( k++ > a + A167507(k), ); print1(k", "); a+=A167507(k)) (PARI) a=k=0; for(n=1, 99, until( k++ > a + A167507(k), ); print1(a+=A167507(k), " ("French(k)"), ")) \\ to print the total length + name of a(n), see A167507 for French(). CROSSREFS Sequence in context: A315068 A315069 A315070 * A095948 A315071 A315072 Adjacent sequences:  A233182 A233183 A233184 * A233186 A233187 A233188 KEYWORD nonn,word AUTHOR Eric Angelini and M. F. Hasler, Dec 05 2013 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.

Last modified January 23 11:04 EST 2019. Contains 319391 sequences. (Running on oeis4.)