User:Cloudy176/Croutonillion

Croutonillion is a groundbreakingly pointless googologism, consisting of a ridiculous sequence of totally arbitrary steps. It is constantly under construction, so please edit this page and add to it!

Croutonillion is the mother of all salad numbers &mdash; a gross parody of many new googologists' attempts to create large numbers, following the misguided philosophy that "if it's more complicated, it's bigger."

To avoid total anarchy, please mind the following guidelines:


 * Don't copy other pages or repeat large pieces of the definition. Everything on this page should be created by hand.
 * Explain any notation that may be unclear.
 * Avoid any ambiguous or context-dependent definitions, such as values that vary over time or anything having to do with the iota function.
 * Don't delete any existing content without a good reason (such as content defying these guidelines).



Definition
"X" refers to the result of the previous operation. Start with googoltriplex.


 * 1) X^^^...^^^X (X copies of ^)
 * 2) BB(X)
 * 3) megafuga(booga(X))
 * 4) X-xennaplex
 * {X, X / 2}
 * 1) (Rayo's number)X
 * 2) BB(X) (repeat this step Y times, where Y is the value of Clarkkkkson on January 1, googolgong CE)
 * 3) \(f_{\Gamma_0}(X)\)
 * 4) giggol-X-plex
 * 5) X!!!...!!! (nested factorials, meameamealokkapoowa oompa times)
 * 6) gongulus-(2X + 1)-plex
 * 7) TREE(TREE(TREE(...TREE(X)...))) (X nested functions)
 * 8) ceil(Xpi)
 * {X, X | 2}
 * 1) Ξ(X). Do this step Y times, where Y is computed with the following steps:
 * 2) Set Y = 3.
 * 3) Y{Y}(Y + 2)
 * 4) falpha(Y) in FGH, where alpha is Goucher's ordinal
 * 5) T(Y) (Torian)
 * 6) Circle(Y) (Steinhaus-Moser notation). Do this googol times.
 * 7) E10#^^#X (with X copies of #)
 * Let f(x) be the result when going through all the steps up and excluding 16-th. Go in reverse order, and start with X.
 * 1) f(TREE(X))th apocalyptic number
 * 2) fgoober bunch(x)
 * 3) X@X@X@X@X@X@X (legiattic array of)
 * 4) X^^^^^X
 * 5) X^^^^^^X
 * 6) X^^^^^^^X
 * 7) X^^^^^^^^X
 * 8) f(x)^^^...^^^f(x) (f(x) copies of ^)
 * 9) SCG(TREE(SCG(TREE(SCG(f(x) + tritri) + supertet) + superpent) + superhex) + supersept) + Moser
 * 10) Exploding Tree Function(X)
 * 11) Rayo13(X)
 * Create an alternate version of Croutonillion by stopping here (do the 103X + 3). Call this alternate C.
 * 1) ΣX(C)
 * 2) X^^^^^^^^^^^^^X
 * 3) XvvvvvvvvvvvvvX (down arrows)
 * 4) X -> X -> X -> X -> X (chained arrows)
 * {X, X (1) 2}
 * 1) X$ (Pickover's superfactorial)
 * 2) gag-X
 * 3) Xsuper gongulus
 * 4) {X & L}10,10
 * X!
 * 1) H(H(...(X)...)) (X nested functions), repeat grangoldex times.
 * 2) Same as step 15.
 * 3) {10,100 //...// 2} (X /'s)
 * 4) Repeat 1428571337 times for step 1 to step 40.
 * 5) X{meameamealokkapoowa oompa}(101337)
 * 6) {googolplexian,X,X}
 * 7) greagol-X-threx, then gigangol-X-tetrex, then gorgegol-X-pentex, and so on googol times
 * 8) E100#100...100#100#(X+1) (googol 100's)
 * 9) X-illion
 * 10) X&&...&&X (X &'s)
 * 11) E100#^#X
 * 12) googolplexiangoogolplexian X
 * YX, where Y is lynz at May 1 meameamealokkapoowa-arrowa A.D.
 * 1) terrible tethrathoth-ex-terrible tethrathoth-...-ex-terrible tethrathoth (X terrible tethrathoth's)
 * 2) Rayo(Rayo(X) + 3)
 * 3) Ackermann(X, X)
 * 4) BH(X) starting with a size-X chain of \(\Gamma_0\)s
 * 5) Circle(Circle(X)) (Friedman's circle theorem, not SMN)
 * 6) Length of the Goodstein sequence starting with X
 * 7) X-illion-illion-illion-...-illion-illion-illion, faxul times
 * 8) BOX_M~X X
 * 9) X(Xth digit of pi + 1)
 * 10) Arx(X,X,X,...,X,X,X) (with X X's)
 * 11) \(f_{X}(X)\), repeat X times
 * 12) G(X)
 * 13) E(Y)Y#^^...^^#^#Y (X ^'s), where Y is googolplex.
 * 14) Repeat X times for step 1 to step 63.
 * 15) Repeat X times for step 1 to step 64.
 * 16) Repeat X times for step 1 to step 65.
 * 17) Repeat X times for step 1 to step 66.
 * 18) Repeat X times for step 1 to step 67.
 * 19) Repeat X times for step 1 to step 68.
 * 20) Repeat X times for step 1 to step 69.
 * 21) Repeat X times for step 1 to step 70.
 * 22) 10^^X
 * 23) X^^10
 * 24) X^^X
 * 25) {L & L & L...L & L & L,X}X,X (X L's)
 * 26) 75*75...75*75*X (X 75's)
 * 27) Graham's Number*X*Y, where Y is Step 5.
 * 28) Rayo(X)
 * 29) SCG(SCG(SCG(SCG(X)+googol)+googolplex)+googolplexian)
 * 30) TREE(TREE(TREE(TREE(X)+googol)+googolplex)+googolplexian)
 * 31) Rayo(Rayo(Rayo(Rayo(X)+googol)+googolplex)+googolplexian)
 * 32) Ξ(Ξ(Ξ(Ξ(X)+googol)+googolplex)+googolplexian)
 * 33) Arx(Arx(Arx(Arx(X)+googol)+googolplex)+googolplexian)
 * 34) BH(X) expect for hydra using TFB labels instead of omegas
 * 35) Repeat steps 1-84 until number of repetitions gets OVER 9000 (i.e. 9001 times)
 * 36) Repeat X times for step 85.
 * 37) Repeat X times for step 86.
 * 38) Repeat X times for step 87.
 * 39) Repeat X times for step 88.
 * {X,X (X) X,X}
 * {X,X,X} & X
 * 1) \(1000^{X^{SCG^{SCG^{SCG^{SCG^{SCG^X(X)}(X)}(X)}(X)}(X)}}\)
 * 2) E100#^#^#X
 * 3) E100#^^#^#X
 * 4) E100#^^^#^#X
 * 5) E100#^^^^^^^^^^^^^^^^#^#X + X
 * 6) E100#^^^^^#^#X
 * 7) E100#^^^^^^#^#X
 * 8) E100#^^^^^^^#^#X
 * 9) X^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^X
 * 10) Arx(X,X,X,X)
 * 11) Arx(X,X,X,X,X)
 * 12) 1337133713371337...1337133713371337 (X 1337's)
 * 13) X+1
 * 14) X&&&...&&&X, with X copies of &
 * 15) H(X), Chris Bird's H function
 * 16) H(X), hyperfactorial
 * 17) m1(X), fusible margin function
 * 18) SCGX(X)
 * 19) X -> X -> X -> X -> X
 * 20) cg(X), Conway &amp; Guy's function
 * 21) C(X), Hurford's C function
 * 22) Xi(X)
 * 23) X!!!!! (nested factorial, not multi) or ((((X!)!)!)!)!
 * 24) First Mersenne prime after X, if it exists. Otherwise it is the first number with abundance X.
 * 25) X^^5
 * 26) {10, 100, 1, 3, 3, 7, X}
 * 27) {10, 100 (1337) X}
 * 28) TREEX(X) (repeat this step humongulus times)
 * 29) Rayo(X) (repeat this step humongulus + 1 times)
 * 30) A(X, X) (Ackermann function; repeat this step humongulus + 2 times)
 * 31) X^^^X (repeat this step humongulus + 3 times)
 * 32) giggol-X-plex
 * Create an alternate version of Croutonillion by stopping here. Call this number C2.
 * 1) SCG(SCG(C2 + X) + X) + XC2
 * 2) C*C2*X
 * 3) X!X, Nested Factorial Notation.
 * 4) X^^^C
 * {X,1337,100}
 * 1) {9001,9001,C,X}
 * GX
 * 1) Graham's Number^^^...^^^X (C ^'s)
 * 2) goo-X-ol
 * 3) X-oogol
 * 4) X^^^^^^^^^^^^^^^^^^^^^^^^^^^X
 * 5) 103(X+1), repeat 1000000 times.
 * 6) 2(First prime after log2(X))
 * 7) X-ty-Xs (X copies of X concatenated)
 * 8) X$ (superfactorial, repeat 50 times)
 * 9) Rayo(X)
 * 10) X![X([X([X])X])X] in hyperfactorial array notation
 * 11) {X&L,X}X,X Repeat this for meameamealokkapoowa oompa times. (Note: all Xs are Xs from croutonillion)
 * 12) Repeat step 1 then step 1,2 then step 1,2,3.... then... step 1,2,...,141 for meameamealokkapoowa oompa-brecewah times.
 * 13) X$$$...$$$ where there are X$$...$$ $'s  where there are X$$...$$ $'s where there are X$$...$$ $'s ... X$$...$$ (with X $'s), where there are X$$...$$ layers.  All of this is Nested! Yes, is 2 (w/) just now.
 * 14) X{X{X$$$...$$$}X}X, with X $'s.
 * 15) GG X NESTED GRAHAM!!! Looks like G expanded to 3.
 * 16) Repeat step 1 to 145 for X times. Then do that X times. Then do that X times. Then do that X times. ... Then do that X times. Then do that X times. with X 'Then do that X times'. And, X is changing every step!
 * 17) The number of steps in gijswijt's sequence needed to reach X.
 * 18) Amount of terms in the harmonic series needed to reach X.
 * 19) Define the whole process up to here as the function C(n). Then, define the fast-growing-crouton as follows:
 * 20) * \(C_0(n) = C(n)\)
 * 21) * \(C_{\alpha+1}(n) = C^n_\alpha(C^n(n))\), where \(C^n\) denotes function iteration
 * 22) * \(C_\alpha(n) = C_{\alpha[n]}(n)\) iff \(\alpha\) is a limit ordinal
 * 23) * fundamental sequences are as normal
 * 24) *The value to carry on in the definition is \(C_{ψ_0(Ω_ω)}(X)\)
 * 25) X in a X-gon using Steinhaus-Moser notation
 * 26) Repeat step the last step. X times.
 * 27) G(G(...(X)...)) (G(G(...(X)...)) (...G(G(...(X)...)) (X G's)... G's) G's), X layers.
 * AX, let A0 = X and An = X!(A(n-1)).
 * 1) Age of Jonathan Bowers in the year X^3 C.E. in Planck times.
 * 2) X&&&&&X
 * 3) return value of D(D(D(D(D(X))))) in loader.c
 * 4) S(X), Chris Bird's S function.
 * 5) S(S(...(3)...)), X S's
 * 6) X+401
 * 7) X$[U(X)] using dollar function and U function
 * 8) FGH(6,[X2])
 * 9) Repeat step 1 then step 1,2 then step 1,2,3.... then... step 1,2,...,161 for X times.
 * 10) \((X^100)^{100^X})^{100^{X^X}}\)
 * 11) \(\lfloor(10 \uparrow e) \uparrow\uparrow X\rfloor\)
 * 12) \(X \uparrow_{,_{(\uparrow\uparrow)\uparrow}\uparrow} X\), using this.
 * 13) \(X\$[[X],_{X,\text{S}(X),\text{SCG}(X+\text{KAI U~})}]\)
 * 14) \(\sum^{X}_{i=1}\Sigma(i)\)
 * 15) X-4562645464355123322146346142342456
 * 16) \(\sum^{X}_{j=1}\sum^{j}_{i=1}\Sigma(i)\)
 * 17) Repeat the steps 1 to 169 Rayo(X) times.
 * 18) X![[<1(X)2>1] ]
 * 19) 10*1010, let create a function:
 * 20) n*1m = n+m
 * 21) n*lm = Xm
 * 22) X1 = X
 * 23) XY+1 = n*l-1n...n*l-1n (XY n's)
 * 24) Gen(X, X, X, ..., X) with X X's using this
 * 25) X^X
 * 26) X^^X
 * 27) X^^^X
 * 28) X^^^^^^^^^^^^^^^^^^^X
 * 29) X{X}X
 * 30) XX with X pairs of curly braces
 * 31) X+1
 * 32) X*2
 * {X,X[X/2]X} using BAN
 * 1) \(X^{X+1}\)
 * 2) \(f_{\varepsilon_X+1}(X)\)
 * 3) \(Rayo^{Rayo(X)}(Rayo(X))\)
 * 4) Repeat step 1, then step 1 and 2, then step 1,2 and 3 until 1,2,3,....,183,184,185 for \(\Xi^{\Xi(X)}(\Sigma_X(X))^{\text{Fish number  7}}\$[[0]_2]\)bracewah times
 * 5) Fish number X
 * 6) X![X]![X]![X]!........[X]![X]![X] with X![X] quantity of [X]!
 * 7) \(\Xi^{\Xi(X)}(\Sigma_{X-5}(X))^{\text{Fish number 4}}\$[[25134252432]_X]\)bracewah
 * 8) XC C2
 * Create an alternate version of Croutonillion by stopping here. Call this number C3.
 * 1) C3![C2![C![X]]]
 * 2) Repeat step 191 X^^2 times
 * 3) Repeat step 192 X^^3 times
 * 4) Repeat step 193 X^^4 times
 * 5) Repeat step 194 X^^5 times
 * 6) Repeat step 195 X^^6 times
 * 7) Repeat step 196 X^^7 times
 * 8) Repeat step 197 X^^8 times
 * 9) Repeat step 198 X^^9 times
 * 10) Repeat step 199 X^^10 times
 * 11) X![1,2,3,4...........X-2,X-1,X]
 * 12) X$ into X$-gons
 * 13) repeat step 1 to 202 for Xgrand Sprach Zarathustra times
 * 14) XX&X using BEAF
 * 15) $$X\rightarrow X\rightarrow X\rightarrow X$$
 * 16) $$E[X]X\#\#X$$
 * 17) $$E[X]X\#\uparrow^X\#X$$
 * 18) $$E[X]X\#\uparrow^{\#\uparrow^{\#}\#}\#X$$
 * 19) $$X \rightarrow X \rightarrow X \rightarrow X \rightarrow X$$ using Conway's chained arrow in hypermathmatics
 * 20) $$X$$ inside a $$2X$$-sided polygon
 * 21) $$\Sigma(X)$$
 * 22) $$Rayo^X(X)$$
 * 23) $$X+1$$
 * 24) $$X\times2$$
 * 25) $$X\uparrow X$$
 * 26) $$X\uparrow^{X}X$$
 * 27) $$X\rightarrow X = X \uparrow_{1}\uparrow X$$ using this
 * 28) $$\{X, X[1\backslash1\backslash2]X\}$$
 * 29) Repeat steps 1 to 218
 * 30) Repeat steps 1 to 219
 * 31) Repeat steps 1 to 220
 * 32) Repeat steps 1 to 221
 * Create an alternate version of Croutonillion by stopping here. Call this number C4.
 * 1) \(C4\uparrow^{C3\uparrow^{C2\uparrow^{C}C2}C3}C4\)
 * 2) \(C4\underbrace{\uparrow_{\uparrow_{..._{\uparrow_{\uparrow}}}}}_{C3\underbrace{\uparrow_{\uparrow_{..._{\uparrow_{\uparrow}}}}}_{C2\underbrace{\uparrow_{\uparrow_{..._{\uparrow_{\uparrow}}}}}_{C\underbrace{\uparrow_{\uparrow_{..._{\uparrow_{\uparrow}}}}}_{X}C}C2}C3}C4\)
 * 3) Aarexhydra(x)
 * 4) X + C4
 * 5) X + C3
 * 6) X + C2
 * 7) X + C
 * 8) 10^X
 * 9) X{34}X
 * 10) $$f_\omega(X)$$
 * 11) $$f_{\Gamma_0}(X)$$
 * 12) $$f_{\theta(\Omega^\omega)}(X)$$
 * 13) $$f_{\theta(\Omega^\Omega)}(X)$$
 * 14) $$f_{\theta(\varepsilon_{\Omega+1})}(X)$$
 * 15) $$f_{\theta(\theta_1(\omega))}(X)$$
 * 16) $$f_{\theta(\theta_1(\Omega))}(X)$$
 * 17) $$f_{\theta(\theta_1(\Omega_2))}(X)$$
 * 18) $$f_{\theta(\theta_I(0))}(X)$$
 * 19) $$f_{\theta(\theta_M(0))}(X)$$
 * 20) $$f_{\theta(\theta_K(0))}(X)$$
 * Create an alternate version of Croutonillion by stopping here. Call this number C5.
 * 1) \(\text{Grand Sprach Zarathustra}^{X^{SCG^{SCG^{SCG^{SCG^{SCG^X(X)}(X)}(X)}(X)}(X)}}\)
 * 2) BB(X)
 * 3) X-xennaplex
 * 4) (Rayo's number)^X
 * 5) Repeat all steps 1-247
 * Create an alternate version of Croutonillion by stopping here. Call this number C6.
 * 1) X + C6
 * 2) X + C5
 * 3) X + C4
 * 4) X + C3
 * 5) X + C2
 * 6) X + C
 * 7) 10^X
 * 8) X^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^X
 * 9) $$f_\omega(X)$$
 * 10) $$f_{\Gamma_0}(X)$$
 * 11) $$f_{\theta(\Omega^\omega)}(X)$$
 * 12) $$f_{\theta(\Omega^\Omega)}(X)$$
 * 13) $$f_{\theta(\varepsilon_{\Omega+1})}(X)$$
 * 14) $$f_{\theta(\theta_1(\omega))}(X)$$
 * 15) $$f_{\theta(\theta_1(\Omega))}(X)$$
 * 16) $$f_{\theta(\theta_1(\Omega_2))}(X)$$
 * 17) $$f_{\theta(\theta_I(0))}(X)$$
 * 18) $$f_{\theta(\theta_M(0))}(X)$$
 * 19) $$f_{\theta(\theta_K(0))}(X)$$
 * 20) repeat step 1, step1-2, step 1-2-3,........, step 1-2-3-......266 for \([(X\$)!(X\$)]![(X\$)!(X\$)]\$\) times.
 * 21) Go into reverse order until step 1 (the first step of the entire list) then repeat this process (step 1 to 267, go reverse from step 267 to step 1) \([(X\$)!(X\$)]![(X\$)!(X\$)]\$\) times.
 * 22) \(X\text{%}\), Warp Notation
 * 23) \(X\text{%}\text{%}\)
 * 24) \(X\text{%}_2\)
 * 25) \(X\text{%}_{\text{%}}\)
 * 26) \(X(1)\)
 * 27) \(X(1)_{(1)}\)
 * 28) \(X(2)\)
 * 29) \(X((1))\)
 * 30) \(X(0_1)\)
 * 31) \(X(0_{0_1})\)
 * 32) \(X(0 \rightarrow 1)\)
 * 33) \(X(0 \rightarrow_2 1)\)
 * 34) \(X(0 \rightarrow_{0_1} 1)\)
 * 35) \(X(0 \rightarrow_{0 \rightarrow 1} 1)\)
 * 36) \(X(0 (1)\rightarrow 1)\)
 * 37) \(X(0 (0 \rightarrow 1)\rightarrow 1)\)
 * 38) X^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^X
 * 39) $$R_0(X)$$
 * 40) $$R_0(X)=Rayo(X)$$
 * 41) $$R_{\alpha+1}(X)=R_\alpha^X(X)$$
 * 42) $$R_\alpha(X)=R_{\alpha[X]}(X)$$ if $$\alpha$$ is a limit ordinal
 * 43) $$R_\omega(X)$$
 * 44) $$R_{\varepsilon_0}(X)$$
 * 45) $$R_{\Gamma_0}(X)$$
 * 46) $$R_{\theta(\theta_I(0))}(X)$$
 * 47) $$R_{\theta(\theta_M(0))}(X)$$
 * 48) $$R_{\theta(\theta_K(0))}(X)$$
 * 49) Repeat steps 1 to 292 {C, C2, [C3] C4, C4 [C5[C5]C5] C6, C6, C6} times (using BAN)
 * 50) \(f_{C(\Omega^X)}(10^100)\)
 * 51) Repeat step 294 {X,X[C[C2[C3[X]C4]C5]C6]2} times (using Aarex's Array Notation)
 * 52) Repeat same step above X^X times.
 * 53) Repeat same step above X^^X times.
 * 54) Repeat same step above X^^^^X times.
 * 55) Repeat same step above X^^^^^^^^X times.
 * 56) Repeat same step above X^^^^^^^^^^^^^^^^X times.
 * 57) Repeat same step above X^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^X times.
 * 58) X^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^X
 * {X, X, X, X, 1, 2, 6, 6, 5}
 * 1) X -> X -> X
 * 2) BBX(X)
 * {X,X...X,X}/w {C,C...C,C}/w {C2,C2...C2,C2}/w {C3,C3...C3,C3}/w {C4,C4...C4,C4}/w {C5,C5...C5,C5}/w C6 entries entries entries entries entries entries
 * 1) 10^100-illion-illion-...-illion-illion/w X -illion's
 * 2) Sigma^^...^^X(X)/w X ^'s
 * 3) f^^X(X) = f^f...f^f(X)(X)...(X)(X)/w X nested
 * 4) f^^^X(X) = f^^f...f^^f(X)(X)...(X)(X)/w X nested
 * 5) Rayo^^...^^(X)/w X ^'s
 * 6) Repeat step 309 X times
 * 7) XA B, where A is the number of bits with value 1 on the wikitext source (in UTF-8) of revision 589365846 of the Wikipedia article "Crouton" and B is the number of cats in Mew-Genics
 * 8) X^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^X!!!!!!!!!!!!!!!!!!!!!!!!!!!!111111111111111111111111111111111111111
 * 9) X@X (BEAF)
 * 10) Rayo(Rayo(X))^^X
 * X^2
 * 1) X + 1
 * 2) X + 1
 * 3) X + 1
 * 4) X + 1
 * 5) X + 1
 * 6) X + 1
 * 7) X + 1
 * 8) X + 1
 * 9) X + 1
 * 10) X + 1
 * 11) X^^X^^X
 * 12) BB(X)
 * 13) BB2(X)
 * 14) X-ex-grand godgahlahgong
 * 15) X-ex-horrendous godsgodgulus
 * {X,X,X,X,X} & 123456789
 * 1) repeat step 1-331 for X![C,C2,C3,C4,C5,C6] times
 * 2) repeat step 1-332 for X![C,C3,C4,C5,C6,C2] times
 * 3) repeat step 1-333 for X![C,C4,C5,C6,C2,C3] times
 * 4) repeat step 1-334 for X![C,C5,C6,C2,C3,C4] times
 * 5) repeat step 1-335 for X![C,C6,C2,C3,C4,C5] times
 * 6) repeat step 1-336 for X![C2,C3,C4,C5,C6,C] times
 * 7) repeat step 1-337 for X!]C2,C4,C5,C6,C,C3] times
 * 8) repeat step 1-338 for X![C2,C5,C6,C,C3,C4] times
 * 9) repeat step 1-339 for X![C2,C6,C,C3,C4,C5] times
 * 10) repeat step 1-340 for X![C2,C,C3,C4,C5,C6] times
 * 11) repeat step 1-341 for X![C3,C4,C5,C6,C,C2] times
 * 12) repeat step 1-342 for X![C3,C5,C6,C,C2,C4] times
 * 13) repeat step 1-343 for X![C3,C6,C,C2,C4,C5] times
 * 14) repeat step 1-344 for X![C3,C,C2,C4,C5,C6] times
 * 15) repeat step 1-345 for X![C3,C2,C4,C5,C6,C] times
 * 16) repeat step 1-346 for X![C4,C5,C6,C,C2,C3] times
 * 17) repeat step 1-347 for X![C4,C6,C,C2,C3,C5] times
 * 18) repeat step 1-348 for X![C4,C,C2,C3,C5,C6] times
 * 19) repeat step 1-349 for X![C4,C2,C3,C5,C6,C] times
 * 20) repeat step 1-350 for X![C4,C3,C5,C6,C,C2] times
 * 21) repeat step 1-351 for X![C5,C6,C,C2,C3,C4] times
 * 22) repeat step 1-352 for X![C5,C,C2,C3,C4,C6] times
 * 23) repeat step 1-353 for X![C5,C2,C3,C4,C6,C] times
 * 24) repeat step 1-354 for X![C5,C3,C4,C6,C,C2] times
 * 25) repeat step 1-355 for X![C5,C4,C6,C,C2,C3] times
 * 26) repeat step 1-356 for X![C6,C,C2,C3,C4,C5] times
 * 27) repeat step 1-357 for X![C6,C2,C3,C4,C5,C] times
 * 28) repeat step 1-358 for X![C6,C3,C4,C5,C,C2] times
 * 29) repeat step 1-359 for X![C6,C4,C5,C,C2,C3] times
 * 30) repeat step 1-360 for X![C6,C5,C,C2,C3,C4] times
 * Create an alternate version of Croutonillion by stopping here. Call this number C7.
 * 1) C7{13407807929942597099574024998205846127479365820592393377723561443721764030073546976801874298166903427690031858186486050853753882811946569946433649006084096}C7
 * 2) X{(7625597484987((7625597484987)↑7625597484987(7625597484986)↑7625597484987(7625597484985)↑7625597484987    (7625597484984)....↑7625597484987(3)↑7625597484987(2))![C7]}X
 * 3) X^C7^C6^C5^C4^C3^C2^C
 * 4) ((((((((((((X$)$)$)$)$.........$)$)$) with X$ copies of $
 * 5) X^^X^^^^^^^^^^^^^^^^^^^^^^^^^^X
 * 6) X^13824738491753421456157942865248127854242242240165023749024510725001548180242404205142434080502264240808046105160404060
 * 7) X&&&&&&.......&&&&&&&&&X with  {(3)3[ω^(1+1)+ω^(1+1)+ω^(1)+ω^(1)+1+1]} copy of &
 * 8) repeat step 1-368 then go reverse from step 368-1 ,repeat X*E100{#&#&#&#&#&#&#&#&#&#& ... &#&#&#&#&#&#&#&#&#&#}100w/grand Sprach Zarathustra #s
 * 9) Repeat step 369
 * 10) Repeat step 369 then 370
 * 11) Repeat step 360, 370, then 371
 * 12) X-th item of Gugold series
 * 13) X-th item of Throogol series
 * 14) X-th item of Godgahlah series
 * 15) X-th item of Tethrathoth series
 * 16) Repeat step 372-375 X times.
 * 17) X + C
 * 18) X + C2
 * 19) X + C3
 * 20) X + C4
 * 21) X + C5
 * 22) X + C6
 * 23) X + C7
 * 24) X + (C+C2)
 * 25) X + (C+C3)
 * 26) X + (C+C4)
 * 27) X + (C+C5)
 * 28) X + (C+C6)
 * 29) X + (C+C7)
 * 30) X + (C+C2+C3)
 * 31) X + (C+C2+C4)
 * 32) X + (C+C2+C5)
 * 33) X + (C+C2+C6)
 * 34) X + (C+C2+C7)
 * 35) X + (C+C2+C3+C4)
 * 36) X + (C+C2+C3+C5)
 * 37) X + (C+C2+C3+C6)
 * 38) X + (C+C2+C3+C7)
 * 39) X + (C+C2+C3+C4+C5)
 * 40) X + (C+C2+C3+C4+C6)
 * 41) X + (C+C2+C3+C4+C7)
 * 42) X + (C+C2+C3+C4+C5+C6)
 * 43) X + (C+C2+C3+C4+C5+C7)
 * 44) X + (C+C2+C3+C4+C5+C6+C7)
 * 45) X * C
 * 46) X * C2
 * 47) X * C3
 * 48) X * C4
 * 49) X * C5
 * 50) X * C6
 * 51) X * C7
 * 52) X * (C*C2)
 * 53) X * (C*C3)
 * 54) X * (C*C4)
 * 55) X * (C*C5)
 * 56) X * (C*C6)
 * 57) X * (C*C7)
 * 58) X * (C*C2*C3)
 * 59) X * (C*C2*C4)
 * 60) X * (C*C2*C5)
 * 61) X * (C*C2*C6)
 * 62) X * (C*C2*C7)
 * 63) X * (C*C2*C3*C4)
 * 64) X * (C*C2*C3*C5)
 * 65) X * (C*C2*C3*C6)
 * 66) X * (C*C2*C3*C7)
 * 67) X * (C*C2*C3*C4*C5)
 * 68) X * (C*C2*C3*C4*C6)
 * 69) X * (C*C2*C3*C4*C7)
 * 70) X * (C*C2*C3*C4*C5*C6)
 * 71) X * (C*C2*C3*C4*C5*C7)
 * 72) X * (C*C2*C3*C4*C5*C6*C7)
 * 73) X^C
 * 74) X^C2
 * 75) X^C3
 * 76) X^C4
 * 77) X^C5
 * 78) X^C6
 * 79) X^C7
 * 80) X^(C+C2)
 * 81) X^(C+C3)
 * 82) X^(C+C4)
 * 83) X^(C+C5)
 * 84) X^(C+C6)
 * 85) X^(C+C7)
 * 86) X^(C+C2+C3)
 * 87) X^(C+C2+C4)
 * 88) X^(C+C2+C5)
 * 89) X^(C+C2+C6)
 * 90) X^(C+C2+C7)
 * 91) X^(C+C2+C3+C4)
 * 92) X^(C+C2+C3+C5)
 * 93) X^(C+C2+C3+C6)
 * 94) X^(C+C2+C3+C7)
 * 95) X^(C+C2+C3+C4+C5)
 * 96) X^(C+C2+C3+C4+C6)
 * 97) X^(C+C2+C3+C4+C7)
 * 98) X^(C+C2+C3+C4+C5+C6)
 * 99) X^(C+C2+C3+C4+C5+C7)
 * 100) X^(C+C2+C3+C4+C5+C6+C7)
 * 101) X^(C*C)
 * 102) X^(C*C2)
 * 103) X^(C*C3)
 * 104) X^(C*C4)
 * 105) X^(C*C5)
 * 106) X^(C*C6)
 * 107) X^(C*C7)
 * 108) X^(C*C2*C3)
 * 109) X^(C*C2*C4)
 * 110) X^(C*C2*C5)
 * 111) X^(C*C2*C6)
 * 112) X^(C*C2*C7)
 * 113) X^(C*C2*C3*C4)
 * 114) X^(C*C2*C3*C5)
 * 115) X^(C*C2*C3*C6)
 * 116) X^(C*C2*C3*C7)
 * 117) X^(C*C2*C3*C4*C5)
 * 118) X^(C*C2*C3*C4*C6)
 * 119) X^(C*C2*C3*C4*C7)
 * 120) X^(C*C2*C3*C4*C5*C6)
 * 121) X^(C*C2*C3*C4*C5*C7)
 * 122) X^(C*C2*C3*C4*C5*C6*C7)
 * 123) X^(C^C)
 * 124) X^(C^C2)
 * 125) X^(C^C3)
 * 126) X^(C^C4)
 * 127) X^(C^C5)
 * 128) X^(C^C6)
 * 129) X^(C^C7)
 * 130) X^(C^C2^C3)
 * 131) X^(C^C2^C4)
 * 132) X^(C^C2^C5)
 * 133) X^(C^C2^C6)
 * 134) X^(C^C2^C7)
 * 135) X^(C^C2^C3^C4)
 * 136) X^(C^C2^C3^C5)
 * 137) X^(C^C2^C3^C6)
 * 138) X^(C^C2^C3^C7)
 * 139) X^(C^C2^C3^C4^C5)
 * 140) X^(C^C2^C3^C4^C6)
 * 141) X^(C^C2^C3^C4^C7)
 * 142) X^(C^C2^C3^C4^C5^C6)
 * 143) X^(C^C2^C3^C4^C5^C7)
 * 144) X^(C^C2^C3^C4^C5^C6^C7)
 * Create an alternate version of Croutonillion by stopping here. Call this number C8.
 * 1) X![C,C2,C3,C4,C5,C6,C7,C8]
 * 2) repeat step 376 to 506 X^^^^^^^^^^(X Times ^)^^^^^^^^^^^^^X
 * 3) repeat step 1 to 507, go reverse from 507 to 1, all for X^C8^C7^C6^C5^C4^C3^C2^C times
 * 4) repeat steps 100 to 200
 * 5) repeat steps 200 to 100
 * 6) Do the following steps in order: 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, ... according to the ruler sequence, up to step 510.
 * 7) X&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&X
 * 8) {((X,X)!)![((X,X)!),((X,X)!),....((X,X)!) Times terms ((X,X)!)....((X,X)!),((X,X)!)]}
 * 9) [(X&&&&&&&&&&X)^(X&&&&&&&&&X)]^[(Fish number 7)#\(\text{googolplex} \downarrow\downarrow \text{googolplex}\)]
 * 10) X-acthul-x-on (example: 7-acthul-9-on would be heptacthulennon)
 * {X,X\\\\.....\\\\\X} with {X,X\\\\.....\\\\\X} with {X,X\\\\.....\\\\\X}...[continue X times]... with {X,X\\\\.....\\\\\X} with X^^^X \s
 * 1) E100#****.....*****^^^^^.....^^^^^###.......######100,000,000,000 with X *s, X ^s, and X #s
 * 2) X-icahlah
 * 3) X-ongulus
 * 4) X![XX]
 * 5) X-ee-x-ol
 * 6) X-th prime
 * 7) First odd composite number after X
 * 8) Repeat step 522 and 523 googolplex  googolplex times (X {}'s)
 * 9) \(f_{X}(X)\)
 * Create an alternate version of Croutonillion by stopping here. Call this number C9.
 * 1) C^C2^^C3^^^C4^^^^C5^^^^^C6^^^^^^C7^^^^^^^C8^^^^^^^^C9^^^^^^^^^X
 * 2) C^X+C2^X+C3^X+C4^X+C5^X+C6^X+C7^X+C8^X+C9l
 * 3) {X^{E100.000.000.000.000.000.000.000{#&#&#&#&#&#..........((443,426,488,243,037,769,948,249,630,619,149,892,803^443,426,488,243,037,769,948,249,630,619,149,892,803) Times # elements)..........#&#&#&#&#&#}$}^{E100.000.000.000.000.000.000.000{#&#&#&#&#&#..........((443,426,488,243,037,769,948,249,630,619,149,892,803^443,426,488,243,037,769,948,249,630,619,149,892,803) Times # elements)..........#&#&#&#&#&#}$}^..........{{X^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^(443,426,488,243,037,769,948,249,630,619,149,892,803^443,426,488,243,037,769,948,249,630,619,149,892,803) Times {E100.000.000.000.000.000.000.000{#&#&#&#&#&#..........((443,426,488,243,037,769,948,249,630,619,149,892,803^443,426,488,243,037,769,948,249,630,619,149,892,803) times # elements)..........#&#&#&#&#&#}$}}..........^{E100.000.000.000.000.000.000.000{#&#&#&#&#&#..........((443,426,488,243,037,769,948,249,630,619,149,892,803^443,426,488,243,037,769,948,249,630,619,149,892,803) Times # elements)}$}..........#&#&#&#&#&#}$}E100.000.000.000.000.000.000.000}![C,C2,C3,C4,C5,C6,C7,C8,C9]
 * 4) Repeat step 1, 1-2, 1-2-3, 1-2-3-4,........, 1-2-3-......-527, 1-2-3......-528, then go in reverse order: step 528, 528-527, 528-527-526,......, 528-527-526-........-3-2-1 for X![X,X,X......(X copies of Xs).....X,X,X] times
 * 5) \(X^{X^{SCG^{SCG^{SCG^{SCG^{SCG^X(X)}(X)}(X)}(X)}(X)}}\)
 * 6) \(X\underbrace{\uparrow_{\uparrow_{..._{\uparrow_{\uparrow}}}}}_{C9\underbrace{\uparrow_{\uparrow_{..._{\uparrow_{\uparrow}}}}}_{C8\underbrace{\uparrow_{\uparrow_{..._{\uparrow_{\uparrow}}}}}_{C7\underbrace{\uparrow_{\uparrow_{..._{\uparrow_{\uparrow}}}}}_{C6\underbrace{\uparrow_{\uparrow_{..._{\uparrow_{\uparrow}}}}}_{C5\underbrace{\uparrow_{\uparrow_{..._{\uparrow_{\uparrow}}}}}_{C4\underbrace{\uparrow_{\uparrow_{..._{\uparrow_{\uparrow}}}}}_{C3\underbrace{\uparrow_{\uparrow_{..._{\uparrow_{\uparrow}}}}}_{C2\underbrace{\uparrow_{\uparrow_{..._{\uparrow_{\uparrow}}}}}_{C}C2}C3}C4}C5}C6}C7}C8}C9}X\)
 * 7) f^{f^^{f^^^{X}(X)}(X)}(X), where f(n) = n+1.
 * 8) X{X{X{X}X}X}X
 * 9) X^X^X^X^X^X^X
 * 10) X*X*X*X*X*X*X
 * 11) X+X+X+X+X+X+X
 * 12) E100 #*{#,#,1,2}# X
 * 13)  X ↑X ↑ ...X ↑ X ↑ X X  X...  X  X w/ the amount of Xs being X on each side
 * 14) (X^GRAND SPRACH ZARATHUSTRA)#***...***^^^...^^^###...###(X^GRAND SPRACH ZARATHUSTRA) with X *s, X ^s, and X #s
 * 15) (XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX)^E100%100#2)![(grand grand grand grand transmorgrifihgh = E100*(*(*( ... *(*(*(#))) ... )))100 w/grand grand grand transmorgrifihgh *'s),.....((grand grand grand grand transmorgrifihgh = E100*(*(*( ... *(*(*(#))) ... )))100 w/grand grand grand transmorgrifihgh *'s) times (grand grand grand grand transmorgrifihgh = E100*(*(*( ... *(*(*(#))) ... )))100 w/grand grand grand transmorgrifihgh *'s)elements.....,(grand grand grand grand transmorgrifihgh = E100*(*(*( ... *(*(*(#))) ... )))100 w/grand grand grand transmorgrifihgh *'s)]
 * 16) Repeat previous step X Times
 * 17) Repeat previous step X^X Times
 * 18) Repeat previous step X^X^X Times
 * 19) Repeat previous step X^X Times
 * 20) Repeat previous step X Times
 * 21) X{(7625597484987((7625597484987)↑7625597484987(7625597484986)↑7625597484987(7625597484985)↑7625597484987    (7625597484984)....↑7625597484987(3)↑7625597484987(2))![C]}X
 * 22) X{(7625597484987((7625597484987)↑7625597484987(7625597484986)↑7625597484987(7625597484985)↑7625597484987    (7625597484984)....↑7625597484987(3)↑7625597484987(2))![C,C2]}X
 * 23) X{(7625597484987((7625597484987)↑7625597484987(7625597484986)↑7625597484987(7625597484985)↑7625597484987    (7625597484984)....↑7625597484987(3)↑7625597484987(2))![C,C2,C3]}X
 * 24) X{(7625597484987((7625597484987)↑7625597484987(7625597484986)↑7625597484987(7625597484985)↑7625597484987    (7625597484984)....↑7625597484987(3)↑7625597484987(2))![C,C2,C3,4]}X
 * 25) X{(7625597484987((7625597484987)↑7625597484987(7625597484986)↑7625597484987(7625597484985)↑7625597484987    (7625597484984)....↑7625597484987(3)↑7625597484987(2))![C,C2,C3,C4,C5]}X
 * 26) X{(7625597484987((7625597484987)↑7625597484987(7625597484986)↑7625597484987(7625597484985)↑7625597484987    (7625597484984)....↑7625597484987(3)↑7625597484987(2))![C,C2,C3,C4,C5,C6]}X
 * 27) X{(7625597484987((7625597484987)↑7625597484987(7625597484986)↑7625597484987(7625597484985)↑7625597484987    (7625597484984)....↑7625597484987(3)↑7625597484987(2))![C,C2,C3,C4,C5,C6,C7]}X
 * 28) X{(7625597484987((7625597484987)↑7625597484987(7625597484986)↑7625597484987(7625597484985)↑7625597484987    (7625597484984)....↑7625597484987(3)↑7625597484987(2))![C,C2,C3,C4,C5,C6,C7,C8]}X
 * 29) X{(7625597484987((7625597484987)↑7625597484987(7625597484986)↑7625597484987(7625597484985)↑7625597484987    (7625597484984)....↑7625597484987(3)↑7625597484987(2))![C,C2,C3,C4,C5,C6,C7,C8,C9]}X
 * 30) repeat step 528 X Times
 * 31) repeat step 529 X Times
 * 32) repeat step 530 X Times
 * 33) repeat step 531 X Times
 * 34) \(\Xi^{\Xi(X)}(\Sigma_{X-1}(X))^{\text{Fish number 7}}\$[[9876543210123456789]_X]\)bracewah
 * 35) repeat step 1-559 then 559-1 for X%X#X
 * 36) X times e100{#,#(0,1)2}100 according to http://googology.wikia.com/wiki/User:Wythagoras/Extended_Cascading-E_Notation
 * Create an alternate version of Croutonillion by stopping here. Call this number C10.
 * 1) 2048{X}C{X}C2{X}C3{X}C4{X}C5{X}C6{X}C7{X}C8{X}C9{X}C10
 * 2) C10^C9^C8^C7^C6^C5^C4^C3^C2^C^X
 * 3) X-ex-terrible tethrathoth
 * 4) 5^17^257^65537^X
 * 5) X(0->0->11) on Warp Notation
 * 6) X(0[2]1)
 * 7) X(0(X+1)->{X+1})X = X(0(X)->{0(X)->{...0(X)->{0(X)->{1}(X+1)->{X}}{1}( X+1)->{X}...}{1}(X+1)->{X}}{1}(X+1)->{X})/w X nested
 * 8) {X(0(X+1)->{X+1})X}***...***^^^...^^^###...###\\\...\\\///...///{X(0(X+1)->{X+1})X} with {X(0(X+1)->{X+1})X} *'s and ^'s and #'s and \'s and /'s
 * 9) {X(0(X+1)->{X+1})X}%%%%%....%%%%%{X(0(X+1)->{X+1})X} reply of step 568-569
 * 10) {X(0->0->0->1X+1)X}{#&#&#&...{X(0->0->0->1X+1)X} Times #& ...&#&#&#&#}{X(0->0->0->1X+1)X}
 * 11) Repeat step 100, 200, 300, 400, and 500 X times
 * 12) X$ [ [0(0,0/0...0/11)1]]/w X 0's
 * 13) E100 {#,#(1)2} X
 * 14) E100 {#,#,1,1,2} X
 * 15) E100 {#,#,1,#} X
 * 16) E100 {#,#,1,3} X
 * 17) E100 {#,#,#,2} X
 * 18) E100 {#,{#,#,1,2},1,2} X
 * 19) E100 {#,#+2,1,2} X
 * 20) E100 #*(#*^#)# X
 * 21) E100 #**^# X
 * 22) E100 #*^# X
 * 23) E100 &(&(#)) X
 * 24) E100 &(#) X
 * 25) E100 &(1) X
 * 26) E100 {#,#,1,2} X
 * 27) E100 #^^^# X
 * 28) E100 #^^#^^# X
 * 29) E100 #^^## X
 * 30) E100 #^^#>#^^# X
 * 31) E100 #^^#># X
 * 32) E100 #^^# X
 * 33) E100 #^#^# X
 * 34) E100 #^## X
 * 35) E100 #^# X
 * 36) E100 ## X
 * 37) E100 # X
 * EX
 * 1) X*2
 * Create an alternate version of Croutonillion by stopping here. Call this number C11.
 * 1) X+1
 * 2) X+1/Finaloogol
 * 3) X+1/C11
 * 4) E100 # ^{1337}X
 * 5) m1(X), normalized fusible margin function
 * 6) TREEX(X)
 * 7) EX###################################################################################X!
 * X
 * 1) 200330410030201X
 * {X,C11 [1[1][1] ... [1] [2]  2] 2}/w C10^C9^C8^C7^C6^C5^C4^C3^C2^C^X nested
 * 1) EX { #,# [1[1][1] ... [1] [2]   2] 2} C11/w C10^C9^C8^C7^C6^C5^C4^C3^C2^C^X
 * 2) X^^^^^^^^^B1, where B1 is the binary data of this image interpreted as an integer (Big-endian with the most significant bit first): [[File:Extreme_facepalm.jpg]]
 * 3) X^C1^B1^C2^C11
 * 4) X(1 -> 3 -> 3 ->1337 7)
 * 5) 203^431,112,937#^^^^########^^^^######>#^#X
 * 6) 42^X
 * 7) 69^^X
 * 8) 420{420}X
 * 9) {666,X(1)2}
 * 10) {1337,1337(X,X)1337}
 * 11) {9001,X/2}
 * 12) {L(X),Graham's number}Graham's number, Graham's number

Croutonillion is $$10^{3X+3}$$.