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 A354792 #17 Jul 18 2022 09:48:48 %S A354792 1,6,35,22,39,85,14,33,65,34,133,69,319,155,481,82,119,57,253,1247, %T A354792 235,403,74,287,901,177,1159,737,1633,2117,215,611,2449,166,3293,679, %U A354792 697,159,1121,671,1541,2059,365,4343,1339,5029,3379,158,3071,623,1649,4633 %N A354792 Nonprime terms in A354790 in order of appearance. %H A354792 Rémy Sigrist, <a href="/A354792/b354792.txt">Table of n, a(n) for n = 1..5715</a> %H A354792 Rémy Sigrist, <a href="/A354792/a354792.txt">C program</a> %o A354792 (Python) %o A354792 from math import lcm, gcd %o A354792 from itertools import count, islice %o A354792 from collections import deque %o A354792 from sympy import factorint %o A354792 def A354792_gen(): # generator of terms %o A354792 aset, aqueue, c, b, f = {1}, deque([1]), 2, 1, True %o A354792 yield 1 %o A354792 while True: %o A354792 for m in count(c): %o A354792 if m not in aset and gcd(m,b) == 1 and all(map(lambda n:n<=1,fs:=factorint(m).values())): %o A354792 if len(fs) > 1: %o A354792 yield m %o A354792 aset.add(m) %o A354792 aqueue.append(m) %o A354792 if f: aqueue.popleft() %o A354792 b = lcm(*aqueue) %o A354792 f = not f %o A354792 while c in aset: %o A354792 c += 1 %o A354792 break %o A354792 A354792_list = list(islice(A354792_gen(),30)) # _Chai Wah Wu_, Jul 17 2022 %o A354792 (C) See Links section. %Y A354792 Cf. A354790, A354791. %K A354792 nonn %O A354792 1,2 %A A354792 _Michael De Vlieger_ and _N. J. A. Sloane_, Jul 17 2022 %E A354792 More terms from _Rémy Sigrist_, Jul 17 2022