User:Cloudy176/The Best of Deleted Googologisms/Foreverception

Foreverception is the largest number ever. It is defined as follows: u1(n)=n^^^^(n-1 arrows)^^^n-1^^^^...5^^^^4^^^3^^2^1 u2(n)=u1^u1^u1^u1^...u1^n(n)(n)(n)(...(n)(n) with u1(n) copies of u1 the rest of the U functions are a sequence of functions going down v1=uuuuuu...uuuuun(n)(n)(n)(n)(n)....(n)(n) with n copies of u v2=uv1(uv1(uv1...uv1(uv1(n)(n)(n).....(n)(n)(n) with v1^n copies of uv1 the rest of the v fucNctins are defined with stacks n[1]=vn^n(n) n[2]=n[1][1][1][1][1][1][...[1][1] with n coipes of [1] n[3] n[4] and the rest of the functions are defined the same way w1=Graham's number[Graham's number] w2=w1[w1] the rest of w is defined the same way With this defnition foreverception is not a salad number grahaprime is the FIRst Prime afteR Grahms numbr Rp is first prime after wwwwwwww...wwwwwww(grahaprime) with graprime w's Z1 is equal to Rp[rp[rp[rp[...rp[rp]]]]]...]]] with rp copies now for each new z numbr replace rp with the previus z numbr Zp is defined as the first prime after ZZZZZZZZZZZZZZZZ...ZZZZZ1 with Rp Z's foreverception is finally defined as:

a stack of z's with a 1 at the end, with the previous number of z's in each stank and Zp Layers

do you now see how foreverception is the biggest number ever?