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 A355138 #8 Jun 21 2022 10:28:23 %S A355138 2,12,90,525,490,84,198,1815,550,60,126,735,350,120,252,1617,1694,132, %T A355138 234,2535,650,140,294,315,150,220,726,495,300,280,882,945,600,560, %U A355138 1078,2541,396,168,1274,3549,468,240,700,2205,378,156,1690,975,180,264,1210,825,270,504,980,1575,540,312 %N A355138 The products of consecutive terms in A355061. %C A355138 See A355061 for further details. %H A355138 Scott R. Shannon, <a href="/A355138/a355138.png">Image of the first 250000 terms</a>. %o A355138 (Python) %o A355138 from sympy import primefactors %o A355138 from itertools import count, islice %o A355138 def agen(): # generator of terms %o A355138 an1, an, f1, f, pset = 2, 6, {2}, {2, 3}, {2, 12} %o A355138 yield from [2, 12] %o A355138 for n in count(4): %o A355138 an2, an1, an, f2, f1 = an1, an, 6, f1, f %o A355138 f = set(primefactors(an)) %o A355138 while an*an1 in pset or f1&f == set() or f2&f != set() or f <= f1: %o A355138 an += 1; f = set(primefactors(an)) %o A355138 pset.add(an*an1); yield an*an1 %o A355138 print(list(islice(agen(), 58))) # _Michael S. Branicky_, Jun 20 2022 %Y A355138 Cf. A355061, A355139. %K A355138 nonn %O A355138 1,1 %A A355138 _Scott R. Shannon_, Jun 20 2022