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.

A366864 Numbers m such that A366470(m) > A366470(m-1).

Original entry on oeis.org

4, 5, 10, 13, 24, 39, 84, 168, 370, 836, 1998, 4622, 11284, 28151, 53565, 138230, 334125, 659741, 1716635, 3977282, 10430384, 27132843, 71588934, 189472352, 505341104, 1353331592
Offset: 1

Views

Author

Chai Wah Wu, Oct 25 2023

Keywords

Comments

Inspired by N. J. A. Sloane's remark about the graph of A366470 consisting of decreasing segments. Terms mark the beginning of these segments in the graph of A366470. Appears to grow exponentially. Terms seem to be near the values of t_i described in Sloane's sketch at A364054.

Crossrefs

Programs

  • Python
    from itertools import count, islice
    from sympy import nextprime
    def A366864_gen(): # generator of terms
        a, aset, p = 1, {0,1}, 2
        for i in count(3):
            for b in count(a,p):
                if b not in aset:
                    aset.add(b)
                    c = b%(p:=nextprime(p))
                    if c > a:
                        yield i
                    a = c
                    break
    A366864_list = list(islice(A366864_gen(),20))