OFFSET
0,1
COMMENTS
From Natan Arie Consigli, Oct 09 2016: (Start)
Wainer's fast-growing function is defined as follows:
w_0(x) = x+1;
w_n+1(x) = (w_n)^x(x) = w_n(w_n(...w_n(x)) (x iterations);
This function is a particular instance of the fast-iteration hierarchy function F[k]_n(x). Wainer's fast-growing function is F[1]_n(x). See A275000 for details and definitions.
Because of its simple definition, this function is a popular benchmark for large number functions. (End)
LINKS
Googology Wiki, Fast Growing Hierarchy
Project Euclid, Wainer:Accessible Segments of the Fast Growing Hierarchy
Wikipedia, Fast-growing hierarchy
FORMULA
w_0(x) = x+1;
w_1(x) = (((x+1)+1)+...+1) = x+x = 2*x;
w_2(x) = 2(2(...(2(2x))) = 2^x*x;
w_3(x) = Product_{k=0...x} b(k), where b(0)=x, b(m+1) = 2^Product_{l=0...m} b(l). - Benoit Jubin, Jan 15 2009; edited by Natan Arie Consigli, Oct 09 2016
EXAMPLE
Using formula:
a(0) = w_0(2) = 1+2 = 3;
a(1) = w_1(2) = 2*2 = 4;
a(2) = w_2(2) = 2^2*2 = 8;
a(3) = w_3(2) = Product_{k=0...2} b(k) = b(0)*b(1)*b(2) = 2 * 2^b(0) * 2^(b(1)*b(0)) = 2 * 2^2 * 2^(2^2*2) = 2048;
Using recursion:
a(0) = w_0(2) = 1+2 = 3;
a(1) = w_1(2) = w_0(w_0(2)) = w_0(3) = 3+1 = 4;
a(2) = w_2(2) = w_1(w_1(2)) = w_1(4) = (w_0)^4(4) = 4+1+1+1+1 = 8;
a(3) = w_3(2) = w_2(w_2(2)) = w_2(8) = (w_1)^8(8) = ... = 2048;
a(4) is obtained by applying the operation w_2(x) 2048 times to 2048, where w_2(2^p) = 2^( 2^p+p ). Thus a(5) is larger than 2^(2^(...2^(2^11+11)...)), with 2049(?) occurrences of "2^". - M. F. Hasler, Jan 15 2009; edited by Natan Arie Consigli, Oct 09 2016
MATHEMATICA
w[0, x_] := x + 1; w[n_, x_] := Nest[w[n - 1, # ]&, x, x]; Table[w[n, 2], {n, 0, 3}] (* edited by Natan Arie Consigli, Oct 09 2016 *)
CROSSREFS
KEYWORD
nonn,nice,bref
AUTHOR
Vladimir Reshetnikov, Jan 14 2009
EXTENSIONS
Revised by Natan Arie Consigli, Apr 03 2016, Oct 09 2016
STATUS
approved