Troobawamba

The troobawamba is equal to \(\{10,10,10,100(1)2\}\ \&\ 10\) using the array of operator and BEAF. It has troobol entries. The term was coined by Cookie Fonster.
== Approximations in other notations ==
Notation 	Approximation 	Approximation 	Approximation
Bird's array notation 	\(\{10,100 [1 [1 \backslash 1 \backslash 2 \neg 2] 1 [2 \backslash 3 \neg 2] 2] 2\}\)	\(\{10,100 [1 [1 \backslash 1 \backslash 2 \neg 2] 1 [2 \backslash 3 \neg 2] 2] 2\}\)	\(\{10,100 [1 [1 \backslash 1 \backslash 2 \neg 2] 1 [2 \backslash 3 \neg 2] 2] 2\}\)
Fast-growing hierarchy	\(f_{\theta\left(\Omega^{\Omega}+\Omega^{2}\omega\right)}(100)\) 	\(f_{\theta\left(\Omega^{\Omega}+\Omega^{2}\omega\right)}(100)\) 	\(f_{\theta\left(\Omega^{\Omega}+\Omega^{2}\omega\right)}(100)\)
== Sources ==
== See also ==
Category:Numbers
Category:Higher array notation
Category:BEAF
Category:Numbers by Cookie Fonster
Category:Bachmann's collapsing level
Category:Unformalised