cp's OEIS Frontend

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.

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

Original entry on oeis.org

2, 3, 7, 5, 11, 19, 13, 17, 31, 23, 47, 37, 29, 59, 61, 79, 131, 83, 107, 103, 127, 137, 317, 53, 67, 71, 73, 211, 41, 43, 97, 263, 139, 89, 347, 379, 149, 457, 173, 179, 947, 101, 109, 191, 647, 181, 269, 271, 431, 433, 439, 113, 557, 193, 569, 449, 197, 151
Offset: 1

Views

Author

Michael De Vlieger, Aug 15 2025

Keywords

Crossrefs

Programs

  • Mathematica
    Block[{c, j, k, m, p, r, nn},
      nn = 3000; c[] := False; m[] := 1; j = 2; c[1] = c[2] = True; r = 1;
      {1}~Join~Monitor[Most@ Reap[Do[
        If[PrimePowerQ[j],
          Set[{p, k, m}, {#1, #1^(#2 - 1), #1^(#2 - 1)}] & @@
            FactorInteger[j][[1]]; While[And[c[k*p], k != 0], k--];
            If[k == 0, k = m; While[c[k*p], k++]]; k *= p,
          k = j - 1; While[And[Or[c[k], CoprimeQ[j, k]], k != 1], k--];
            If[k == 1, k += j; While[Or[c[k], CoprimeQ[j, k] ], k++] ] ];
        If[PrimeQ[k], Sow[k]];
        Set[{c[k], j}, {True, k}], {n, 3, nn}] ][[-1, 1]], n] ]