cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

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).

Original entry on oeis.org

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
Offset: 1

Views

Author

Eric Angelini and M. F. Hasler, Dec 05 2013

Keywords

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 A233187-A233188 for German variants.

Examples

			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), ...

Links

Programs

  • 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().

A233188 a(n) is the least number not smaller than the total number of letters in the German names for all terms up to and including a(n).

Original entry on oeis.org

4, 8, 11, 19, 30, 40, 48, 60, 68, 80, 89, 100, 117, 140, 158, 180, 199, 218, 240, 260, 279, 300, 305, 330, 348, 370, 390, 400, 410, 430, 450, 470, 489, 500, 519, 540, 560, 580, 598, 618, 640, 660, 680, 700, 705, 730, 750, 770, 790, 800, 811, 830, 850, 870, 889, 900, 919, 940, 960, 980, 998, 1011, 1030, 1050, 1069, 1090, 1110
Offset: 1

Views

Author

Eric Angelini and M. F. Hasler, Dec 05 2013

Keywords

Comments

See A233187 for a variant using strict inequality, "larger" instead of "not smaller", in the definition. See A233184 and A233185 for related English and French versions.

Links

Programs

  • PARI
    a=0;k=0;for(n=1,99,until( k++ > a + A007208(k),); print1(k,","); a+=A007208(k))

A233186 a(n) is the least number not smaller than the total number of letters in the French names for all terms up to and including a(n).

Original entry on oeis.org

5, 8, 15, 20, 28, 38, 50, 60, 66, 80, 95, 100, 106, 116, 128, 140, 156, 175, 195, 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
Offset: 1

Views

Author

Eric Angelini and M. F. Hasler, Dec 05 2013

Keywords

Comments

A variant of A233185 and the English version A233184. Whereas in the English case the use of the weak inequality would only change the first, third and fourth term (credits to H. Havermann), there are more differences between the two variants in the French version. See A233187-A233188 for German variants.

Links

Programs

  • PARI
    a=0;k=0;for(n=1,99,until( k++ >= a + A167507(k),); print1(k,","); a+=A167507(k))
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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