User blog:TechKon/Sponge's Graham Generator

This is a twist on Aarex's Graham Generator, that I think might be a little faster. I have been working on this on paper for the past 2 nights, and it was tiring, but pretty fun.
 * \(G_{n(1)}\) is defined as \(G_{G_{n}}\)
 * \(G_{n(2)}\) is defined as Googological_Notation_-_Sponge's_Graham_Generator_-_Representation_1.png
 * \(G_{n(3)}\) is defined as Googological_Notation_-_Sponge's_Graham_Generator_-_Representation_2.png
 * \(G_{n(4)}\) is defined as Googological_Notation_-_Sponge's_Graham_Generator_-_Representation_3_(v2).png
 * \(G_{n(m)}\); m representing the amount of recursive procedures minus one, with each ending amount being \(G_{n(m-1)}\). That was a bit hard to explain, so review the pattern of \(G_{n(1)}\) to \(G_{n(4)}\) to get the idea.
 * more soon