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

0, 2, 2048, 6973568802, 590295810358705651712, 4440892098500626161694526672363281250, 7659889842507589786155370254176860349292085605349868961792, 6468953019249515982689295538200433621714406397809250801867790662783382919273856120002

Offset

0,2

Comments

Next term is 128 * 8^128 = 2^391, which has 118 digits.

This function is a particular instance of the fast-iteration 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

Table of n, a(n) for n=0..7.

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

Table[2 n^(2 n^2 + 2), {n, 0, 7}] (* Michael De Vlieger, Nov 30 2016 *)

Crossrefs

Sequence in context: A024034 A101722 A004908 * A004813 A342294 A089981

Adjacent sequences: A274999 A275000 A275001 * A275003 A275004 A275005

Keyword

nonn

Author

Natan Arie Consigli, Nov 09 2016

Status

approved