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.

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.

Programs

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