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.

A318554 a(n) is the smallest prime number having order of primeness = prime(n).

Original entry on oeis.org

3, 5, 31, 709, 9737333, 3657500101, 2586559730396077, 4123221751654370051, 28785866289100396890228041
Offset: 1

Views

Author

David James Sycamore, Aug 27 2018

Keywords

Comments

Let F(k) denote A049076(k). The list of primes p such that F(p) = n begins with q, the smallest prime to have prime index in each of n-1 successive primeth iterations, finally taking nonprime index 1 at the n-th iteration. All other members p such that F(p) = n are primes > q which also take a nonprime index at the n-th iteration. The reverse sequence of associated indices for q = prime(n) gives successive terms of the primeth recurrence 1,2,3,5,... until reaching A007097(prime(n)) = a(n).

Examples

			The sequence of primes with order of primeness F(p) = prime(1) = 2 begins 3,17,41,67,...
so a(1)=3. Likewise, F(p) = prime(2) = 3 begins 5,59,179,... so a(2)=5.
		

Crossrefs

Formula

a(n) = A007097(prime(n)); n >= 1.