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 A366869 #9 Oct 26 2023 10:28:52 %S A366869 1,4,15,26,81,158,417,990,2491,6402,17363,44450,119773,326786,659957, %T A366869 1845500,4779649,9921002,27575339,67458614,187615521,515594444, %U A366869 1433794185,3989181038,11160791967,31287537756 %N A366869 a(n) = A366470(A366864(n)). %C A366869 Terms of A366470 at the beginning of a segment (except for the first segment). %o A366869 (Python) %o A366869 from itertools import count, islice %o A366869 from sympy import nextprime %o A366869 def A366869_gen(): # generator of terms %o A366869 a, aset, p = 1, {0,1}, 2 %o A366869 for i in count(3): %o A366869 for b in count(a,p): %o A366869 if b not in aset: %o A366869 aset.add(b) %o A366869 c = b%(p:=nextprime(p)) %o A366869 if c > a: %o A366869 yield c %o A366869 a = c %o A366869 break %o A366869 A366869_list = list(islice(A366869_gen(), 20)) %Y A366869 Cf. A364054, A366470, A366864, A366868. %K A366869 nonn,more %O A366869 1,2 %A A366869 _Chai Wah Wu_, Oct 25 2023