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.
%I A366864 #13 Dec 23 2024 14:53:46
%S A366864 4,5,10,13,24,39,84,168,370,836,1998,4622,11284,28151,53565,138230,
%T A366864 334125,659741,1716635,3977282,10430384,27132843,71588934,189472352,
%U A366864 505341104,1353331592
%N A366864 Numbers m such that A366470(m) > A366470(m-1).
%C A366864 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.
%H A366864 Seqfan discussion, <a href="https://web.archive.org/web/*/http://list.seqfan.eu/pipermail/seqfan/2023-October/074906.html">Re: Ali Sada's A364054</a>.
%o A366864 (Python)
%o A366864 from itertools import count, islice
%o A366864 from sympy import nextprime
%o A366864 def A366864_gen(): # generator of terms
%o A366864 a, aset, p = 1, {0,1}, 2
%o A366864 for i in count(3):
%o A366864 for b in count(a,p):
%o A366864 if b not in aset:
%o A366864 aset.add(b)
%o A366864 c = b%(p:=nextprime(p))
%o A366864 if c > a:
%o A366864 yield i
%o A366864 a = c
%o A366864 break
%o A366864 A366864_list = list(islice(A366864_gen(),20))
%Y A366864 Cf. A364054, A366470.
%K A366864 nonn,more
%O A366864 1,1
%A A366864 _Chai Wah Wu_, Oct 25 2023