cp's OEIS Frontend

A387076 Primes in the order in which they appear in A386482.

%I A387076 #7 Aug 16 2025 01:15:37
%S A387076 2,3,7,5,11,19,13,17,31,23,47,37,29,59,61,79,131,83,107,103,127,137,
%T A387076 317,53,67,71,73,211,41,43,97,263,139,89,347,379,149,457,173,179,947,
%U A387076 101,109,191,647,181,269,271,431,433,439,113,557,193,569,449,197,151
%N A387076 Primes in the order in which they appear in A386482.
%H A387076 Michael De Vlieger, <a href="/A387076/b387076.txt">Table of n, a(n) for n = 1..1030</a>
%t A387076 Block[{c, j, k, m, p, r, nn},
%t A387076   nn = 3000; c[_] := False; m[_] := 1; j = 2; c[1] = c[2] = True; r = 1;
%t A387076   {1}~Join~Monitor[Most@ Reap[Do[
%t A387076     If[PrimePowerQ[j],
%t A387076       Set[{p, k, m}, {#1, #1^(#2 - 1), #1^(#2 - 1)}] & @@
%t A387076         FactorInteger[j][[1]]; While[And[c[k*p], k != 0], k--];
%t A387076         If[k == 0, k = m; While[c[k*p], k++]]; k *= p,
%t A387076       k = j - 1; While[And[Or[c[k], CoprimeQ[j, k]], k != 1], k--];
%t A387076         If[k == 1, k += j; While[Or[c[k], CoprimeQ[j, k] ], k++] ] ];
%t A387076     If[PrimeQ[k], Sow[k]];
%t A387076     Set[{c[k], j}, {True, k}], {n, 3, nn}] ][[-1, 1]], n] ]
%Y A387076 Cf. A386482, A387077.
%K A387076 nonn
%O A387076 1,1
%A A387076 _Michael De Vlieger_, Aug 15 2025