Latri

Latri is equal to {3,3,3 (1) 2} = {3,3 (1) 3} = {3,2 (1) 4} in BEAF. The term was coined by Jonathan Bowers.
Latri is comparable to \(f_{\omega^\omega+2}(3)\) in the fast-growing hierarchy.
=== Computation ===
Latri can be computed in the following process:
# Let = 3.
# Let = {3,3,3} (a.k.a. tritri).
# Let = {3,3,...,3,3} (where the number of threes is ) = {3,{3,3,3} (1) 2} (a.k.a. dupertri).
# Continuing, let = {3,3,...,3,3} (with threes) = {3, (1) 2}.
# Latri is equal to .
=== Approximations ===
Notation 	Approximation
Bird's array notation 	\(\{3,3,3 [2] 2\}\) (exact)
Cascading-E notation 	\(\textrm E3\#\text{^}\#3\#3\#3\)
Hyperfactorial array notation 	\(3![3,1,1,2]\)
Fast-growing hierarchy 	\(f_{\omega^{\omega}+1}(f_{\omega^{\omega}}(\text{tritri}))\)\(\approx f_{\omega^\omega+1}(f_{\omega^\omega}(f_3(f_2(35))))\)
X-Sequence Hyper-Exponential Notation	\(3\{X^X+1\}3\{X^X\}3\{3\}3\)
Hardy hierarchy 	\(H_{\omega^{\omega^{\omega}+1}+\omega^{\omega^{\omega}}+\omega^{4}}(3)\)
Slow-growing hierarchy 	\(g_{\theta(\Omega^\Omega,\theta(\Omega^\Omega))}(3)\)
=== Sources ===
=== See also ===
ja:ラトリ
Category:Numbers
Category:Numbers by Jonathan Bowers
Category:2 row
Category:Greek-based name
Category:BEAF
Category:Powers of 3
Category:Exponentiated linear omega level