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.

A361931 a(n) is the smallest number k such that A361929(k) = prime(n), or -1 if no such prime exists.

Original entry on oeis.org

1, 2, 7, 10, 26, 177, 508, 13812, 73873, 4638434, 4638435, 1874400183, 114936835817
Offset: 1

Views

Author

Samuel Harkness, Mar 30 2023

Keywords

Comments

It is conjectured that all primes appear in A361929.

Crossrefs

Cf. A361929.

Programs

  • Mathematica
    K = {2}; R = {1}; r = 2; z = 1; While[Length@R < 9, z++; p = 2; While[MemberQ[K[[Length@K - GCD[z - 1, Last@K] + 1 ;; Length@K]], p], p = NextPrime[p]]; AppendTo[K, p]; If[p > r, AppendTo[R, z]; r = p]; If[Length@K > NextPrime[r], K = K[[Length@K - NextPrime[r] ;; Length@K]]]]; Print[R]

Extensions

a(12)-a(13) from Kevin Ryde, Apr 01 2023