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.

A372607 Let a(1) = 2, f(n) = a(1)*a(2)*...*a(n-1) for n >= 1 and a(n) = nextludicnumber(f(n)+1) - f(n) for n >= 2, where nextludicnumber(x) is the smallest ludic number > x.

Original entry on oeis.org

2, 3, 5, 7, 11, 23, 13, 25, 17
Offset: 1

Views

Author

Davide Rotondo, May 07 2024

Keywords

Comments

Conjecture: every element is a ludic number.
This is the analog of Buss' conjecture (cf. A067836) for ludic numbers instead of primes, and similar to the idea of ludic Fortunate numbers (A376237) in analogy to the usual Fortunate numbers A005235. - M. F. Hasler, Nov 04 2024

Crossrefs

Cf. A067836, A003309 (ludic numbers), A376237 (ludic Fortunate numbers).

Programs