Isn’t the finding of superprimes as simple as storing the primes in an array, and then just referencing that array with the contents of the array?
An array of primes (start at P(1) if you don’t consider 1 a prime.)
P(0) = 1
P(1) = 2
P(2) = 3
P(3) = 5
P(4) = 7
P(5) = 11
And the superprimes:
P(P(0)) = 2
P(P(1)) = 3
P(P(2)) = 5
P(P(3)) = 11
Once you have your array (as I generated earlier), just reference it’s index with itself to see your super primes.