Factorexation refers to the operation \(n\,\backslash\) (pronounced "\(n\) factorexated"), defined as \[n\,\backslash = n!^{n!} = n! \uparrow\uparrow 2.\] The term was coined by a Googology Wiki user under the alias of "SpongeTechX." Iterated factorexation is written with multiple backslashes, e.g. \(n\,\backslash\backslash\backslash\). It can also be abbreviated \(n\,\backslash^k\) when there are \(k\) iterations. This function can be recursively defined as follows: \(n\backslash^0=n\) and \(n\backslash^{k+1}=(n\backslash^k)!^{(n\backslash^k)!}\)