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 octoquadragintillion 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 elglish 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_LNOTSK \uparrow\uparrow\uparrow\uparrow\uparrow X \)