

A275002


a(n) = 2*n^(2*n^2 + 2).


6



0, 2, 2048, 6973568802, 590295810358705651712, 4440892098500626161694526672363281250, 7659889842507589786155370254176860349292085605349868961792, 6468953019249515982689295538200433621714406397809250801867790662783382919273856120002
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


COMMENTS

Next term is 128 * 8^128 = 2^391, which has 118 digits.
This function is a particular instance of the fastiteration hierarchy function F[k]_n(x). This sequence is also a(n) = F[n]_3(2). See A275000 for details and definitions and formulae.
a(n) is an even function.


LINKS



FORMULA

a(n) = f_3(2), with f_0(x) = x+n, f_k+1(x) = (f_k)^x(x).
a(n) = a(n) because 2*h^(2*h^2 + 2) = 2*(h)^(2*(h)^2 + 2).


MATHEMATICA



CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



