|
%I #27 Jan 11 2020 15:57:47
%S 2,4,18,590295810358705651712
%N a(n) = F[n]_n(2), main diagonal of fast-iteration function applied to 2.
%C The next term is too large to include.
%C The fast-iteration (or extended Grzegorczyk hierarchy) function F[k]_n(x) is defined as follows:
%C F[k]_{n+1}(x) = (F[k]_n)^x(x) = F[k]_n(F[k]_n(...F[k]_n(x)) (with x iterations);
%C F[k]_0(x) = x+k.
%C The base case could be rewritten using n=1 rather than n=0. If so the definition would be:
%C F'[k]_n+1(x) = (F'[k]_n)^x(x);
%C F'[k]_1(x) = x+k.
%C Because of its clear definition, this function is a popular benchmark for large number functions.
%H Googology Wiki, <a href="http://googology.wikia.com/wiki/Fast-growing_hierarchy">Fast Growing Hierarchy</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Fast-growing_hierarchy">Fast-growing hierarchy</a>.
%F For small values of n we have:
%F F[k]_0(x) = x+k;
%F F[k]_1(x) = x+kx = (k+1)x;
%F F[k]_2(x) = x(k+1)^x.
%e F[0]_0(2) = 2+0 = 2;
%e F[1]_1(2) = (1+1)2 = 4;
%e F[2]_2(2) = 2(2+1)^2 = 18;
%e F[3]_3(2) = F[3]_2(F[3]_2(2)) = F[3]_2(2(3+1)^2) = F[3]_2(32) = 32(3+1)^32 = 590295810358705651712.
%t f[k_,0, x_] := x + k; f[k_, n_, x_] := Nest[f[k,n - 1, # ]&, x, x]; Table[f[n, n, 2], {n, 0, 3}]
%Y A154714 gives w_n(2) = F[1]_n(2).
%K nonn
%O 0,1
%A _Natan Arie Consigli_, Oct 08 2016
| 