Goplapulus

Goplapulus is equal to \(\{10,100((1)1)2\}\ \&\ 10\) using the array of operator and BEAF. It is intended to have goplexulus entries. The term was coined by Cookie Fonster.
== Approximations in other notations ==
Since this number hasn't been formalized, these are expectations.
Notation 	Approximation
Bird's array notation 	\(\{10,100 [1 [1 [1 \backslash 1, 2 \neg 2] 2 \neg 2] 2] 2\}\)
Fast-growing hierarchy (Using this system of fundamental sequences)	\(f_{\psi_0(\Omega^{\Omega^{\Omega^{\omega}}})}(100)\)
Hardy hierarchy 	\(H_{\psi_0(\Omega^{\Omega^{\Omega^{\omega}}})}(100)\)
Slow-growing hierarchy 	\(g_{\psi_0(\Omega_2^{\Omega_2^{\Omega_2^{\omega}}})}(100)\)
== Sources ==
== See also ==
Category:Numbers
Category:Higher array notation
Category:BEAF
Category:Unformalised
Category:Numbers by Cookie Fonster
Category:Bachmann's collapsing level