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.

A362909 a(n) is the smallest number k such that A362881(k) = n.

Original entry on oeis.org

1, 3, 6, 10, 22, 31, 34, 37, 40, 121, 1035, 1078, 1121, 7607, 9453, 13667, 13729, 50040, 50123, 50206, 615964, 616448, 616932, 617416, 2828280, 2851232, 2874184, 2897136, 5350614, 5583250, 5594326, 17310256, 17312210, 17994974, 18008820, 19051432, 19069162
Offset: 1

Views

Author

Samuel Harkness, May 14 2023

Keywords

Comments

All positive integers will appear in A362881. Rémy Sigrist showed that as a consequence of Van der Waerden's theorem, A362881 is unbounded.
The present sequence is monotonically increasing since a progression of length n begins with a progression of length n-1 so a(n-1) < a(n).

Crossrefs

Cf. A362881.

Programs

  • C
    /* See links */
  • MATLAB
    See Links section.
    

Extensions

a(25)-a(31) from Yang Haoran, May 17 2023
a(32)-a(37) from Kevin Ryde, May 22 2023