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 A352191 #7 Mar 14 2022 14:03:52 %S A352191 1,2,4,6,9,12,15,18,21,24,25,30,33,36,39,42,51,56,57,77,121,207,333, %T A352191 345,371,391,469,871,1111,1121,1341,1557,1719,2043,2051,2367,3421, %U A352191 3951,4527,6127,6849,10307,11007,11061,11079,11133,11511,14113,16753,16839,16911,17973,18153,19161,27731,28831,29447,36949,46783,49093,49577 %N A352191 Records in A352187. %o A352191 (Python) %o A352191 from math import gcd %o A352191 from itertools import count, islice %o A352191 from sympy import primefactors %o A352191 def A352191_gen(): # generator of terms %o A352191 bset, blist, mmax, c = {1,2}, [1,2], 3, 2 %o A352191 yield from blist %o A352191 while True: %o A352191 for m in count(mmax): %o A352191 if gcd(m,blist[-1]) > 1 and m not in bset: %o A352191 if all(blist[-2] % p == 0 for p in primefactors(blist[-1])) or gcd(m,blist[-2]) == 1: %o A352191 if m > c: %o A352191 yield m %o A352191 c = m %o A352191 blist = [blist[-1],m] %o A352191 bset.add(m) %o A352191 while mmax in bset: %o A352191 mmax += 1 %o A352191 break %o A352191 A352191_list = list(islice(A352191_gen(),30)) # _Chai Wah Wu_, Mar 14 2022 %Y A352191 Cf. A352187, A352192. %K A352191 nonn %O A352191 1,2 %A A352191 _N. J. A. Sloane_, Mar 13 2022