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 A387523 #18 Sep 04 2025 08:41:47
%S A387523 2,3,5,7,13,11,17,19,23,29,31,43,41,37,47,67,61,59,53,73,71,83,79,113,
%T A387523 109,107,103,101,97,89,127,157,151,149,139,137,131,193,191,181,179,
%U A387523 173,167,163,199,197,211,251,241,239,233,229,227,223,313,311,307,293,283,281,277,271,269,263,257,337,331,317,467,463,461,457
%N A387523 Primes in the order in which they first divide a term of A386482.
%C A387523 Conjecture: if c is the first term in A386482 that is divisible by a prime p > 2, then c = 2*p.
%H A387523 Michael De Vlieger, <a href="/A387523/b387523.txt">Table of n, a(n) for n = 1..65536</a> (first 841 terms from N. J. A. Sloane.)
%e A387523 11 first divides A386482(23), but 13 first divides A386482(21), so 13 precedes 11 in this sequence.
%t A387523 Block[{p, s}, p[_] := 0; s = Import["https://oeis.org/A386482/b386482.txt", "Data"][[All, -1]]; Rest@ Reap[Do[Map[If[p[#] == 0, Set[p[#], n]; Sow[#]] &, FactorInteger[s[[n]] ][[;; , 1]]], {n, Length[s]}] ][[-1, 1]] ] (* _Michael De Vlieger_, Sep 03 2025 *)
%Y A387523 Cf. A386482, A386483, A387072, A387076, A387077, A387522, A387524.
%K A387523 nonn,new
%O A387523 1,1
%A A387523 _N. J. A. Sloane_, Sep 03 2025