Let us begin by adopting an apparently strange terminology, and call a prime number p a 'primeth' integer: meaning, the pth integer where p is prime.

It is evident right away that the property of primethness may be applied to members of sequences other than the sequence of integers.

Applying it to the sequence of primeth integers themselves, we see that another sequence suggests itself: the sequence of primeth primeth integers, or primeth primes. By extension, we can construct sequences of primeth primeth primeth integers, and so on. Composite numbers meanwhile do not get the slightest look in. Since they do not appear in the sequence of primeth integers, they do not appear in higher order sequences either. Their position is similar to that of prime numbers with regard to high or low compositeness. Their 'primethness' is non-existent or zero! :-)

I define an Order of Primeness, F(p), as follows.

For a prime p, F(p)=1 unless p is a primeth prime.

If p is a primeth prime, F(p)=2 unless p is a primeth primeth prime.

If p is a primeth primeth prime, F(p)=3 unless p is a primeth primeth primeth prime.

And so on.

All prime integers are primeth integers, a subset of these are primeth primeth integers, a subset of these are primeth primeth primeth integers, etc. The number of 'primeths' in each prime's description equals what I define as its order of primeness F(p).

First of all, there are sequences of primes with F(p)=1,2,3,4,5,...

The first nine terms of each of these sequences is as follows:

We have here a sort of sieve. Having taken the 'integers with prime subscripts', namely the primes, in sequence, we remove those that do not have prime subscripts in that sequence, and iterate.

Other sequences consist of those numbers that remain in the sieve after each iteration, namely those with F(p)>1,2,3,4,...

The first nine terms in each of these sequences are as follows:

Then there is the sequence consisting of the smallest prime p for which F(p) = n, for each n. Thus the smallest prime with F(p)=1 is 2, the smallest with F(p)=5 is 31, the smallest with F(p)=9 is 52711. The first terms are as follows:

The terms of another sequence are simply the values of F(p(n)) for each prime p(n). This starts as follows:

This is a fascinating sequence which I suspect has many interesting features awaiting discovery. Repeating subsequences include the 19-unit long string '1, 2, 1, 1, 1, 3, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1', which appears between terms 12 and 30 and again between terms 36 and 54.

A few were known before. Thus the sequence for F=1 is listed in the OEIS as A007821, Primes p(n) where n is composite, with reference to Clark Kimberling's paper, Fractal sequences and interspersions, Ars Combinatoria, 45 (1997) 157. The sequence for F>1 has also been noted, and appears in the OEIS as A006450, Primes with prime subscripts, with reference to R.E.Dressler and S.T.Parker's paper, Primes with a prime subscript, J. ACM, 22 (1975), 380-381. And the last but one sequence given above also appears, although in a slightly different guise, with a zeroth term, 1, appended at the beginning. This is R.G.Wilson's primeth recurrence (A007097), where the zeroth term is 1 and the (n+1)th term is the nth prime.

The Exploring Primeness Project will report on further investigations in due course.

Copyright, Neil Fernandez 1999.

Last modified: 8 August 1999.