OFFSET
1,1
COMMENTS
a(1), a(3) and a(6) are the only primes found for n up to 10000 using The C/Gmp program in the link which is 17 times faster than the PARI routine. We read large blocks of primes into memory and test in memory.
If another prime exists, it is larger than 418977 digits.
A concept of order can be introduced here by researching and analyzing the next-nextprime, next-next-nextprime etc.
LINKS
C.L. Hilliard,Primes less than 3 trillion
EXAMPLE
For n = 3, 4^7 - 3^3 = 16141, the 3rd entry in the sequence.
PROG
(PARI) ppower(n) = { for(x=1, n, y=(x+1)^prime(x+1)-x^prime(x); print1(y", ") ); }
CROSSREFS
KEYWORD
nonn
AUTHOR
Cino Hilliard, May 15 2009
EXTENSIONS
Edited by R. J. Mathar, May 17 2009
STATUS
approved