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 A355441 #45 Jul 09 2022 06:53:32
%S A355441 2,3,4,8,12,15,16,20,24,40,43,52,55,60,63,68,72,79,87,95,96,108,111,
%T A355441 120,123,136,140,148,151,160,184,211,215,216,227,232,235,239,252,255,
%U A355441 256,260,264,280,283,288,299,307,323,324,327,332,360,363,371,372,375,379
%N A355441 Numbers k such that the sum of the least prime factors of i=2..k is prime.
%H A355441 Jean-Marc Rebert, <a href="/A355441/b355441.txt">Table of n, a(n) for n = 1..5676</a>
%e A355441 8 is a term since the least prime factors of 2..8 are 2, 3, 2, 5, 2, 7, 2 and their sum 23 is prime.
%t A355441 Position[Accumulate[Join[{0}, Table[FactorInteger[k][[1, 1]], {k, 2, 400}]]], _?PrimeQ] // Flatten (* _Amiram Eldar_, Jul 02 2022 *)
%o A355441 (Python)
%o A355441 from sympy import isprime, factorint
%o A355441 from itertools import accumulate, count, islice
%o A355441 def agen(): yield from (k for k, sk in enumerate(accumulate(min(factorint(i)) for i in count(2)), 2) if isprime(sk))
%o A355441 print(list(islice(agen(), 75))) # _Michael S. Branicky_, Jul 02 2022
%o A355441 (PARI) isok(k) = isprime(sum(i=2, k, factor(i)[1,1])); \\ _Michel Marcus_, Jul 04 2022
%Y A355441 Cf. A088821.
%K A355441 nonn
%O A355441 1,1
%A A355441 _Jean-Marc Rebert_, Jul 02 2022