OFFSET
1,1
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..79
Wikipedia, Tetration
FORMULA
For any prime number, p, p tetrated x times, where x is any integer greater than 1, is a prime tetration.
EXAMPLE
a(1) = 2^^2 = 2^2 = 4.
a(2) = 2^^3 = 2^2^2 = 16.
a(3) = 3^^2 = 3^3 = 27.
a(4) = 5^^2 = 5^5 = 3125.
PROG
(PARI) slogint(n, b)=if(n<b, 0, slogint(logint(n, b), b)+1)
tetr(b, n)=my(t=b); for(i=2, n, t=b^t); t
list(lim)=my(v=List(), p, t); for(k=2, slogint(lim\=1, 2), p=1; while(tetr(1.0 * p=nextprime(p+1), k) <= 2*lim, listput(v, tetr(p, k)))); select(n->n<=lim, Set(v)) \\ Charles R Greathouse IV, Jul 19 2016
(PARI) is(n)=my(p, e); e=isprimepower(n, &p); e && (e==p || (e%p==0 && is(e))) \\ Charles R Greathouse IV, Jul 19 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
Tyler Skywalker, Jul 19 2016
EXTENSIONS
a(5) inserted, a(10)-a(12) corrected by Charles R Greathouse IV, Jul 19 2016
STATUS
approved