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 A352192 #7 Mar 14 2022 14:03:39 %S A352192 1,2,3,4,6,7,11,12,15,16,19,20,23,25,28,29,34,38,41,45,49,82,141,216, %T A352192 219,239,266,273,420,610,666,756,841,928,1199,1216,1271,2023,2050, %U A352192 2584,3090,3818,4934,5744,5752,5780,6040,6052,6155,7559,9006,9419,9611,10114,10205,10605,10818,13539,17136,17992,18172 %N A352192 Indices of records in A352187. %o A352192 (Python) %o A352192 from math import gcd %o A352192 from itertools import count, islice %o A352192 from sympy import primefactors %o A352192 def A352192_gen(): # generator of terms %o A352192 bset, blist, mmax, c = {1,2}, [1,2], 3, 2 %o A352192 yield from blist %o A352192 for n in count(3): %o A352192 for m in count(mmax): %o A352192 if gcd(m,blist[-1]) > 1 and m not in bset: %o A352192 if all(blist[-2] % p == 0 for p in primefactors(blist[-1])) or gcd(m,blist[-2]) == 1: %o A352192 if m > c: %o A352192 yield n %o A352192 c = m %o A352192 blist = [blist[-1],m] %o A352192 bset.add(m) %o A352192 while mmax in bset: %o A352192 mmax += 1 %o A352192 break %o A352192 A352192_list = list(islice(A352192_gen(),30)) # _Chai Wah Wu_, Mar 14 2022 %Y A352192 Cf. A352187, A352191. %K A352192 nonn %O A352192 1,2 %A A352192 _N. J. A. Sloane_, Mar 13 2022