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 A372284 #12 May 11 2024 21:58:24 %S A372284 2,3,5,11,7,31,13,19,17,37,29,41,47,59,23,97,53,829,71,149,101,167,79, %T A372284 151,43,103,157,113,139,109,137,197,353,89,277,293,269,229,73,61,571, %U A372284 83,191,691,251,179,127,257,193,173,239,163,331,613,617,311,67,523 %N A372284 Primes in the order in which they appear in A124652. %C A372284 Analogous to A111239, a sequence which instead pertains to A109890. %H A372284 Michael De Vlieger, <a href="/A372284/b372284.txt">Table of n, a(n) for n = 1..2500</a> %e A372284 Let b(x) = A372009(x). %e A372284 Table of first terms: %e A372284 n b(n) a(n) %e A372284 ------------- %e A372284 1 2 2 %e A372284 2 3 3 %e A372284 3 5 5 %e A372284 4 11 11 %e A372284 5 12 7 %e A372284 6 20 31 %e A372284 7 24 13 %e A372284 8 28 19 %e A372284 9 29 17 %e A372284 10 33 37 %e A372284 11 42 29 %e A372284 12 43 41 %e A372284 ... %t A372284 nn = 300; c[_] := False; %t A372284 rad[x_] := rad[x] = Times @@ FactorInteger[x][[All, 1]]; %t A372284 f[x_] := Select[Range[x], Divisible[x, rad[#]] &]; %t A372284 Array[Set[{a[#], c[#]}, {#, True}] &, 2]; s = a[1] + a[2]; %t A372284 {2}~Join~Reap[Do[r = f[s]; k = SelectFirst[r, ! c[#] &]; %t A372284 If[PrimeQ[k], Sow[k]]; c[k] = True; %t A372284 s += k, {i, 3, nn}] ][[-1, 1]] %Y A372284 Cf. A124652, A372009. %K A372284 nonn %O A372284 1,1 %A A372284 _Michael De Vlieger_, Apr 29 2024