User:Eners49/Croutonillion

Croutonillion is a groundbreakingly pointless googolism which consists of a ridiculous sequence of completely arbitrary steps (feel free to edit it as you wish). The number was originally coined by wiki user Vel! but was later deleted. It was recreated by wiki user Cloudy176, but was deleted there as well.

Computation
The number is as follows:

X refers to the result from the previous operation. For step 1, start with Rayo(10) repeated BB(1000000000000000000000000) times.
 * 1) X^^^^^...^^^^^X (X up-arrows)
 * {2, 3, 4, ..., X, X+1}
 * 1) 1&2&3&...&X-1&X
 * {X, X / 2}
 * 1) Repeat steps 1-4 666 Centillion times.
 * 2) ceil(Xpi)
 * 3) (Rayo's number)X
 * 4) Pretend X is a base-X integer and convert this back to a base-10 integer.
 * 5) The smallest number which is divisible by all the numbers from 1 to X (Wiki user Cookiefonster's weak factorial function)
 * 6) Rayo(FOOT(X))^^^^^^^^^^^^^^^^^^^^^^^^^^^^674
 * 7) G(G(G(G(...(64)))...)))) where there are X G functions and G denotes Graham's function
 * 8) X!!!!!!...!!! (1,223,334,444,555,556,666,667,777,777,888,888,889,999,999,990,000,000,000 factorial signs)
 * 9) E100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##100##X
 * 10) booga(megafuga(X))
 * 11) BB(X)
 * 12) (X-illion)-yllion
 * 13) 10^^X
 * 14) E1#2##3###4####5...X
 * 15) X + 1 (WHAT??)
 * 16) Worm(Hydra(X))
 * 17) Repeat steps 1-19 meameamealokkapoowa oompa times
 * 18) Create an alternate version of Croutonillion by stopping here. Call this number C1.
 * {X, X, C1}
 * 1) X*C1
 * 2) X+C1
 * {X, X, Y}, where Y is the value of Clarkkkksonplex on January 1, googolgong CE
 * {X, X(10)10, X}
 * 1) X{BIG FOOT}2
 * 2) 1+(2*(3^(4^^(5^^^(...^^^^X)))...)))
 * 3) X&N, where N is the data of this video represented as a base-10 integer: https://www.youtube.com/watch?v=L_jWHffIx5E
 * {X,X,X}^^^{X,X,X}
 * 1) BB(FOOT(Rayo(TREE(D(G(SCG(Worm(Hydra(megafuga(booga(trooga(fuga(gar(X))))))))))))))
 * {X, X, X, ..., X}, where there are X copies of X.
 * 1) Repeat steps 1-33 Rayo(FOOT(X)^^^^^^^^^^5){1,223,334,444,555,556,666,667,777,777,888,888,889,999,999,990,000,000,000}X times
 * 2) Sasquatch^^^^X
 * 3) X!!!...!!!, where there are megafugagoogolplexbang factorial signs. Repeat this step X times
 * 4) FOOTX(X)
 * 5) \(g_X\)
 * 6) \(^XX\)
 * 7) \(X \uparrow^X X \)
 * 8) (X^X^X^X^X)^(X*X*X*X)+(X36^X19^X18) where X36, X19 and X18 refer to the value of croutonillion at step 36, step 19 and step 18. Then, multiply this by the value of T where T is the value of Lynz^C1^Y on December 31st, (googolgong*googolplexian*boogagoogolplexC1*) CE. Then, multiply by 10^100^1000^10000^tritri^penteicosillion^fugagargantuantugoogolplex^TREE(Gboogagoogolplex.).
 * 9) Repeat steps 1-41 googolgoogolgoogolplexplex times.
 * 10) Multiply by googolplexian↑↑↑↑↑↑↑↑↑↑↑↑(12*13429235683256730952936347809^googolgoogolgoogolgoogolgoogolplex arrows)Rayo(FOOT(Worm(Hydra(X^googolbong))))))).
 * 11) Googolgoogolgoogolgoogolgoogolplexplexplexplexplexate this to Lynz^^^^Clarkkkkson^^^^C1 where the values of Lynz and Clarkkksonplex are those on December 31st, 54,792,332,892,309^^^^4,509,234,798 supermegagoogolgoogolgoogolgoogolgoogolgoogolgoogolgoogolgoogolgoogolgooogolplex CE.
 * 12) latin-X-yllion
 * 13) BB(X)
 * {X, X, X, ..., X, X}, where there are N copies of X, N being the data of this image represented as a base-10 integer.Best kills ever.JPG
 * 1) X^Y, where Y is the value of Clarkkkksonplex on January 1, Sasquatch CE
 * 2) X-yllion-yllion-yllion-...-yllion-yllion (Rayo's Number of -yllions)
 * 3) E100#^^^...^^^#100 (Cascading-E Notation, X up-arrows)
 * 4) Googolgoogolgoogolplexplexate this to G(googolgoogolplex)^^^^^^^^^^^^^^^^(googol^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^(value of Lynz on December 31st,googolgoogolplex CE)
 * 5) E(X)#^^^...^^^#(X^^^^^^^^^^^^^^^^^^^^^^^^^^^^(1 googolgoogolgoogolgoogolplex arrows)value of Clarkkksonplex on December 31st, 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999 CE
 * 6) X^^...^^X (where there are X^X^X^X^Rayo's Number^BIG FOOT^TREE((X-yllion)-illion) arrows)
 * 7) YoctillionX
 * 8) DX(99) (Loader's function from loader.c)
 * 9) X-stack (or 10^^X)
 * 10) Create a function A(X) = repeat steps 1-56 X times, where An(X) = An-1A^(A^(....A^(A(X))(X)...)(X))(X)(X) (where ^ represents iteration of the function) with X A's, then define B(X) as AA_(A_(....A_(A_(A_X(X))(X))(X)....(X))(X)(X) (where _ represents a subscript of the previous character) with X A's, then C, D, E.... Z(X), then AA(X) = ZZ_(Z_(....Z_(Z_(Z_X(X))(X))(X)....(X))(X))(X)(X), then make #[1](X) (where # is any;letter from the english alphabet) = ###....###(X) with X #'s, and #[a](X) = #[a-1][a-1][a-1],,,,[a-1][a-1](X) with X [a-1]'s (you keep them when you break it all down), then create Z[X2](X)
 * {X, X, X, ..., X} (Sasquatch X's)
 * 1) Yottillion^^^X^^9^^^^^^^^^^^^^^^^^^^^^^^^^^^^^(3&3&{3, 3, 3, 3})
 * 2) 60X^^^60!
 * 3) The product of all numbers on the wiki excluding this one hexated to X quattuoroctogintillionated to the number of planck units in X cubic exaexaexameters
 * 4) Easterbunnies^^^^^^X where Easterbunnies is the number of easter bunnies after 10^10^10 years
 * 5) 2 in an X-gon (Steinhaus-Moser Notation)
 * 6) Z[X + 2.718](86.999999 trecentimillitremyritrimilliduotrigintatrecentillion) the big huge function from step 57
 * 7) All functions on the Googology Wiki repeated X^X X times.
 * 8) Rayo(FOOT(Scg(TREE(X)
 * 9) E100#^#100#^#Leviathan number#^#X
 * 10) \(g_X \uparrow\uparrow\uparrow\uparrow\uparrow X \)
 * 11) X^^...^^X (where there are permanentillion^googolception^Sam's Number^gigoombaverse arrows)
 * 12) Sasquatch^Rayo's Number^Graham's Number^BIG FOOT^Sam's Number^TREE(3)^X
 * {X,X,X,X,X,X,X}
 * 1) E100##########X
 * 2) BB(X)
 * 3) X^^^^^^^^^^X
 * 4) Wiki user Eners49's salad number "The Biggest Number Ever", but substitute X at the top right instead of 7^^77,777
 * 5) Repeat steps 1-75 another FOOT(/^^^...^^^/0 with (/^^^...^^^/Z^B0 with Sam's Number ^'s) ^'s) times
 * {2, 3, 4, 5, ... X}
 * 1) Googolduplex^Tritet^Millillion^21^X
 * {3,3,3,[3\X],X,X} in BAN.
 * 1) X+5^X^2+X^^^^^^^X^^^^^^^^^^^^^^^^X
 * 2) 10^X-1
 * 3) X^X^^X^^^...X^^^^...(X ^s)...^^^X
 * 4) RAYO((((X!)!!)!!!)!!!!)+5397
 * 5) 1.0*X
 * 6) USGDCS+(X) where USGDCS+ is defined on my page at [//googology.wikia.com/wiki/User:162.238.217.96 http://googology.wikia.com/wiki/User:162.238.217.96]
 * 7) F(X) where the F function is defined as s(n,n{1{1{1…{1,2,,}…2,,}2,,}2}2) where there are n separators with a double comma in PDAN which is also the limit of PDAN
 * 8) X (insert x arrows here) X (repeat X (insert X arrows here) X) repeat Rayo (X raised to the power X)
 * 9) X expanded to X expanded to X expanded to X, repeat Rayo(Rayo(Rayo(Rayo(Rayo...[TREE(BIG FOOT(Rayo(X)) rayos]
 * 10) Take X's expo factorial
 * 11) X (insert X arrows here) X; do this Rayo(Rayo[there are Rayo(Rayo...{there are rayo(rayo(rayo(X)) rayos}rayos]...Rayo([the sum of X from every step so far])... Now repeat it 10 raised to the power 10 raised to the power 10.. (Do this X expanded to X times) Rayo(Rayo (X))
 * 12) Take a break :D (X multiplied by 1)
 * 13) X expanded X times to X, and that is the number of expansions in the next step, do this p times. p equals X expanded to X X times, than that is the number of of expansion in the next step, repeat Rayo(Graham's number) times
 * 14) this will make X really big..............add 1 to X
 * 15) F(X) and the function is defined as X (insert X arrows) X repeated X (insert X arrows here) X repeated X (insert X arrows here) X by the way each step creates a new X.. Now that is done X oh wait you got it, there are g(Rayo(FOOT(BB(xi(BIG FOOT(X)))))) repetitions
 * 16) 10^X^10^x^10^x^10.. Do this g(g(g(g(g(g(g(Graham's number multiplied by (g(g(g...[there are X times Graham's number g's... And g stands for grahal if you dont know)))))))
 * 17) now... Multiply C1 by C (scroll up and look around if you don't understand.. This will be the new croutonillion)
 * 18) (((((((((((((((((X!)[fill in all the !s]...!)
 * 19) add all numbers from 1 to X.
 * 20) multiply by 99.
 * 21) Rayo( Rayo(Rayo(Rayo([grahams number times g(X) rayos) X^2)))))))) squared
 * 22) Repeat steps one to 100 a millillion times
 * 23) add 2 (insert infinite arrows here) 2 to X
 * 24) X tetrated to X
 * 2X
 * 1) Repeat step 104 1000000000000000000000000000000000000000000^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^1000000000000000000000000000000000000000000000000000000000 times
 * 2) Subtract negative X (2X)
 * 3) Rayo(Rayo(Rayo(Rayo...(there are a millillion^millillion Rayos)..Rayo(X^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^.....(there are X^^^^^^^....[there are X^^^^^^....{there are X^^^^(there are X^^^^^^^^....[there are X... Wait... Well you probably know where this is going so just define the amount X(insert X^X arrows here)X]}..X arrows)
 * 4) Repeat the last step 100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000(insert that big number I wrote there arrows)the big number
 * 5) Define SALAD as 10 tetrated to X multiplied by 37!^36!^35!......^1!^0! Then take that value and take the factorial (Now you know why its named that)
 * 6) SALAD(SALAD arrows) SALAD
 * 7) Repeat last step SALAD times
 * 8) X (insert X multiplied by SALAD arrows here)SALAD. Keep in mind that SALAD is defined using the result of the last step, so it is increasing quickly
 * 9) X (SALAD arrows) SALAD (insert X arrows here) X (SALAD arrows) SALAD... repeat 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 times
 * 10) Add 1.
 * 11) Call X X1, repeat all previous steps to X1 to make X2, continue until XXX...X with X1 X's.
 * 12) Take X, and take X+X, X*X, X^X, on and on, each using the previous result, until you get to X-ation.
 * 13) Repeat steps from 1 to 116 (except for 69th) for X^^X times
 * 14) Dforce forcal(X) (from Loader's function)
 * 15) Now define the largest possible output of function/notation/hierarchy reachable with X symbols, then use the output as symbol ammount of another hierarchy, calculate it's largest possible output and repeat that thing goshomity times.
 * 16) TREE(TREE(TREE(TREE(..........................(X) (there are X of "TREE("s)
 * 17) Repeat the previous steps X times and take the result (Y) and operate on it like so in the Fast Iteration Hierarchy: f_0(Y){[theta(Y)[{psi(W_Y^^Y)]Y&Y[psi(M)]Rayo(Y)}]Y}
 * 18) Miner's number!!!!!!!!... (psi_X(Miner's cardinal) !)
 * 19) f_phi(X^(ANIM arrows),10000000000000000000000,BOX M, GGGGGGGGGGGGGGG64)(15[12]+#[@]{0:3}((2)){2}(1,3){2}2**#*7) with Pound-Star Notation and Copy Notation
 * 20) X&(0,1,2)(1,2,3)(4,5,6)(3,2,1)&s(X&&&X&&&X{1{1{1,,,,,,,,......(ABNIM commas)3}2,,3}2}{a,a,2[1[1¬3]2]2})
 * 21) X[0{0{0{0{0{0 ,_1 1}1}_1 2}1}_1 1}1]X![1,[1,2],1,2] in UNAN and HAN
 * 22) f_psi_X(0(W))(X) with Address Notation.
 * 23) H with Hyper Notation
 * 24) s(X){[theta(epsilon_X,epsilon_X)]X} with Fast Iteration Hierarchy
 * 25) Repeat all of the steps before this step X->X->X->X... (X number of X) times.
 * 26) The s(X){[100000000000000000000]1000000000000000000[1000000000000000000]100000000000}th Mersenne prime.
 * 27) X&&&&&&&&&&&&&&&&&&...(X &)X&(bukuwaha+utter oblivion)
 * 28) The smallest natural number greater than all natural numbers that can be uniquely identified by a Yth order oodle theory (Kth order set theory with a truth predicate) where Y is the value of Croutonillion if this step did not exist and K is the first weakly compact cardinal.
 * 29) X-Expand X to X.
 * 30) Repeat steps 1-133 two killillion times.
 * 31) Rayo(X)
 * 32) Largest finite number defined in some K(X) system in some K2(X) 2-system... ...in some KUtterOblivion(Utter Oblivion) Utter Oblivion-system with usage of less than X (as of step 135) symbols, and the number X (as of step 135) is represented by googolplexth fraction of byte.
 * 33) Rayo n (X) (the superscript represents iteration). Then, have Rayo Y (X), where Y is equal to all the steps before this one repeated Gigomixommwil times.
 * 34) Call the resulting number of the last step "C(0)", then define C(1) as all steps repeated C(0) times, then for overlap all the steps C(0) times, where "overlapped" means reppeating each step, but with a C(0)% faster growth rate.
 * 35) C(2) - all the steps repeated C(1) times, then overlapped C(1) times (all steps with a C(1)% faster growth rate
 * 36) C(3) - same pattern as previous numbers
 * 37) C(999999999)
 * 38) C(C(C(C(99999999999))))
 * 39) C C C C(BIG FOOT)   (C(C(C(C(C(C(C(99999999.......999999)))))))), with C(Rayo's Number) 9's
 * 40) The smallest number divisible by all numbers from 1-X -> N1
 * 41) The smallest number divisible by all numbers from 1- the number defined in step 144->N2
 * 42) The smallest number divisible by all numbers from 1-the number in step 145->N3
 * 43) Nn = The smallest number divisible by all numbers from 1-Nn-1 => N(Rayo's Number)
 * 44) N(BIG FOOT)
 * 45) N(N(N(N(.....(N(N(BIG FOOT)))...)), with C(9999999) N's
 * 46) The Xth prime number
 * 47) All steps repeated 50 million times
 * 48) X+1
 * 49) X -(-2)
 * 50) X+3
 * 51) X+n, where n is such a large number that it would make a difference as large as comparing 100 to C(99999999999999999999999999999999999999)
 * 52) All possible ways to do first X moves on X by X chess board.
 * 53) Repeat step 156 over Sasquatch times.
 * 54) E10#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#^#^#^#^#^#^#^#^#10000#############################################X#X#X#X#X (Cascading-E)
 * 55) The ammount of possible ways to arrange planck particles in an X lightyears wide Universe.
 * 56) q`q(X) where q`q(n) is a function, able to surpass Utter Oblivion in under five steps.
 * 57) Define W(n) as a function that, in under ten steps, generates a number so large, that it is as larger than X (as of step 160), as X (as of step 160) is larger than 1/X (one Xth fraction)
 * 58) X#^#^#^.... (repeating W(X) times) ....^#^#^#^#10000000000000000000000000 (Cascading-E)
 * 59) Repeat all steps from before Q times, where Q is equal to q'q(q'q(q'q... (repeating X (as of step 156) tiems) ...(X)))
 * 60) Take a break once again.
 * 61) Substract negative 1.
 * 62) E#^^^#X
 * 63) Largest number possible in Xth set theory with under X symbols.
 * 64) Repeat all steps from before Goshomity times. Then add one.
 * 65) All possible ways to arrange a distance X times smaller than a plank particle in X universes each X distances X times longer than a lightyear in lenght.
 * 66) The amount of time a snail would travel a distance X light years in lenght
 * 67) The amount of time X black holes each X light years big would take to decay one by one, one at a time.
 * 68) Time it would take for about X of X^^^X solar masses heavy black holes to decay because of hawking radiation. Keep in mind that the time should be measured in one Xth fraction of a planck time.
 * 69) X multiplied by X
 * 70) S0 is as large as ammount of googolminexes you have to add to the value of X to make it as large as X^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^E############10#^#^#^#^#^#^#^#^^^^^^^^^^^^^^^^^^################100000000000000000000000000000000
 * 71) S1 is as large as ammount of googolminexes you have to add to zero to make it as large as step 174 value.
 * SX
 * 1) SSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSX
 * 2) Time it would take for an object, traveling with speed of one killillionth fraction of a planck length per second, to pass the distance required to find a Universe-sized fraction of space, indentical to our own, that evolved in the same way and sequence of events as ours for X years.
 * 3) 10^^^X
 * 4) Rayo(BB(F(FOOT(X)))
 * 5) Rn = Rayo's number, \(f_{\varepsilon_Rn}(X)\)
 * 6) The amount of time it would take to count to X if you counted saying 1 number every BIG FOOT Decades
 * 7) X![200?]
 * 8) E#^#^#^#^#^#^#^#^#^#^#^#^#^#^#^#^^^^^^^^^^^^^#################10####10000000![X]
 * {X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,}
 * 1) TREE(X![X])
 * 2) Expand 4000000000 to X
 * 3) Ammount of Xth fractions of Xth fraction... (repeating X times) ... of a planck time, elapsed since the Big Bang.
 * 4) X + 1
 * 5) X![X]
 * 6) E10##^##^##^##^##X
 * 7) 10^X
 * 8) {10,100,1000,10000,................... ,X}
 * 9) Utter Oblivion but every Oblivion in it's definition is replaced by X.
 * 10) Same with №194 but with it's result istead of every X.
 * 11) Repeat Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Rayo(Yoctillion) times
 * 12) X^^^X
 * 13) X^^^^^^X
 * 14) X^^^...^^^X with X arrows
 * 15) 200![200![200![X]]]^^BIGG^^200^^TREE(200)^^SCG(200)^^Rayo(200)^^FOOT(200)^^Sam's Number
 * 16) Same but with X instead of every 200.
 * 17) !!!(X) where !!! describes an array of every single finite number notation on this wiki.
 * {X,X,X,X,X,X,X,X,X,X,Oblivion}
 * 1) E10####^#^#^#^#^########{10,11,12,13,14...... ,X} (Cascading-E + BEAF)
 * 2) X+0.0...01 with X zeroes
 * 3) Repeat previous 201 steps 207*204*205*203*206 times
 * 4) X + biggest number that can be written on a gwiki page with X symbols let's call this G(X) function. G(x)+x
 * 5) So lets make a function (G,X,X...X,X) with G(X) X's = G((G,X,X...X,X-1),X,X...X,X-1). (G(X,1)=G(G(...(G(G(X)))...)) with G(X) X's)
 * 6) \(f^{X \uparrow\uparrow\uparrow X}_{\vartheta(\Omega_{\vartheta(\Omega_{\vartheta(\Omega_{\vartheta(\Omega})})})})(X)\)
 * 7) \(X \uparrow^{X} \& X\)
 * 8) \(\text{FOOT}^{\text{FOOT}^{X }} (\text{Sasquatch})\)
 * 9) \(\underbrace{G_{G_{G_{G_{._{._{._{G_{G_{G_{G_{X }}}}}}}}}}}} _{X \text{times }} \)
 * 10) \(X \uparrow \uparrow X\) in hypermathematics
 * 11) \(\text{TREE}^{X}(X)\)
 * 12) Now this step will be written in smaller steps:
 * 13) Let [a] = {a,a} and [a,b] = {a,a,b}
 * 14) Then let [.[a].] = [a,a] and a,b = [a,a,a,a... repeated b times... a,a,a,a]
 * 15) [[[[[...[ [[X ]...]]]]]]], where there are X []s
 * 16) Repeat this process Oblivion times
 * 17) \(f^{f_{\vartheta(\Omega_{\vartheta(\Omega_{\vartheta(\Omega_{\omega})})})}(X)}_{f_{\vartheta(\Omega_{\vartheta(\Omega_{\vartheta(\Omega_{\omega})})}) }} (X)\)
 * 18) Repeat all previous 216 steps \(\text{BB}(X)^{\text{TREE}(X)}\) times
 * 19) BBBB BB BB BB... BB (X)...(X) (X) (X) (X) (X) with BB(X) layers.
 * 20) Repeat all previous 218 steps BBBB BB BB BB... BB (X)...(X) (X) (X) (X) (X) with BBBB BB BB BB... BB (X)...(X) (X) (X) (X) (X) with BBBB BB BB BB... BB (X)...(X) (X) (X) (X) (X) with..... BBBB BB BB BB... BB (X)...(X) (X) (X) (X) (X) with BB(BB(BB(X))) BBBB BB BB BB... BB (X)...(X) (X) (X) (X) (X)'s where in the final one there are BB(X) layers.
 * 21) E(1) = Xth step of iteration for the entire page, but with X% faster growth rate, E(n) = E(n-1)th step of iteration for the entire page, but with E(n-1)% faster growth rate.
 * 22) E(5)
 * 23) E(10)
 * 24) E(E(1))
 * 25) E(E(2))
 * 26) E(E(E(...(E(E(1)))..))) with E(1) iterations
 * 27) E(X)
 * 28) E(E(x))
 * 29) X-(-1)
 * 30) X+1
 * 31) Repeat every step from before X^^^^^^^^^^^^^^.....^^^^^X (X arrows) times in Hypermathematics.
 * 32) E(X)
 * 33) X^^^X
 * 34) \(f_\omega(X)\)
 * 35) [| Well Defined Utter Oblivion] but the numbers in the definition are replaced with X
 * 36) GGX, where G is Graham’s function (G64 is Graham’s Number)
 * 37) Repeat steps 1-235 X^^...X arrows...^^X^^...X-1 arrows...^^X...........X^^^^X^^^X^^X^X times. Note: When there is “repeat steps a to b f(X) times”, where f(X) is a function of X, the result of the last term, save the number of times one repeats the steps as Y. After getting back to the step that tells you to repeat previous step(s) Y times, decrement Y by 1. Once Y becomes 0, move on to the next step.
 * 38) X![X,X-1,X-2,...,3,2,1] in HAN.
 * {X,X,X,X} in BEAF.
 * 1) Repeat step 238 X+666 times.
 * 2) 6666666666...X 6’s...666666666
 * 3) f_(ω^(ω2))(X)
 * 4) X+1
 * 5) 3^^^^^^...X arrows...^^^^^3
 * 6) Hydra(X)
 * 7) s(10,X.2) in strong array notation
 * 8) BB(BB(BB(...(BB(BB(X)))...))) X BB’s
 * 9) X^2
 * 10) {10,X,X[X]X[1 \ X]2} in BAN.
 * 11) Let M_[1](X)=s(X,X,X,X,X{X,,,, ...X ,’s... ,,,,X}X,X) and M_[n+1](X)=s(X,X,X,X,X{X,,,, ...X ,’s... ,,,,X}X,X) with the base rule s(a,b) changed from a^b to M_[n](M_[n](...(M_[n](M_[n](a)))...)) with b M_n’s.
 * 12) M_[X](X)
 * 13) Repeat steps 1-250 “M_[M_[...[M_[X](X)]...](X)](X) with X M’s” times.
 * 14) Now let M_[n,#](X)=s(X,X,X,X,X{X,,,, ...X ,’s... ,,,,X}X,X) with the base rule s(a,b) changed from a^b to  M_[n-1,#](M_[n-1,#](...(M_[n-1,#](a))...)) with b M’s, where # is any string of entries of integers equal to or greater than 1 separated by commas (# can be empty); and M_[1,1,...,1,1,c,#](X)=M_[1,1,...,1,(M_[1,1,...,1,(...(M_[1,1,...,1,X,c-1,#](X))...),c-1,#](X)),c-1,#](X) with X M’s. [@,1,1,...,1,1] can be shortened to [@], where @ is any non-empty string, and [1,1,1,...,1,1]=[1].
 * 15) M_[3,3](X)
 * 16) M_[1,1,2](X)
 * 17) M_[X,X,X,...,X,X](X) with X X’s in the [ ]’s.
 * 18) Repeat steps 1-255 2^X times.
 * So, Mk.1 set theory can define the last number, then Mk.(the last number) set theory with (the last number) symbols.