_ represents underscore. Anyways, here is the extended version:
ω = ℕ
ω+1 = {1,2,3,4,...,inf-2,inf-1,1}
ω+2 = {1,2,3,4,...,inf-2,inf-1,1,2}
ω+n = {1,2,3,4,...,inf-2,inf-1,1,2,...,n-2,n-1,n}
ω2 = ω+ω = {1,2,3,4,...,inf-2,inf-1,1,2,...,inf-2,inf-1}
ω3 = ω+ω+ω = ω2 + ω = {1,2,3,4,...,inf-2,inf-1,1,2,...,inf-2,inf-1,1,2,...,inf-2,inf-1}
ω^2 = ωω = ω+ω+... (ω)
ω^3 = ωωω = ωω * ω = ωω ω = ω+ω+...(ω^2)
ω^ω = ωω ω*...(ω)
ω^ω^ω = ωω ω*...(ω^ω)
ε0 = ω^ω^ω^...(ω)
ε_1 = ε0^ε0^ε0^...
ε_n = (ε_n-1)^(ε_n-1)^(ε_n-1)^...
ζ_0 = ε_ε_ε_...(ε0)
φ(4,0) = ζ_ζ_ζ_...(ζ0)
φ(5,0) = φ(4,φ(4,...))
φ(n,0) = φ(n-1,φ(n-1,...))
φ(1,0,0) = φ(φ(...,0),0)
φ(2,0,0) = φ(1,φ(1,...,0),0)
φ(3,0,0) = φ(2,φ(2,...,0),0)
φ(1,0,0,0) = φ(φ(...,0,0),0,0)
φ(1,0,0,0,0) = φ(φ(...,0,0,0),0,0,0)
φ(1,0,0,0,0,0) = φ(φ(...,0,0,0,0),0,0,0,0)
θ(Ω^ω) = φ(1,0,0,0,...) (Small Veblen Ordinal)
This is where we start incorporating uncountable ordinals into countable ordinals. θ(β) where β is an uncountable ordinal or cardinal , it basically makes the uncountable ordinal countable. This is where things are getting more complex. We might not be able to continue further due to the complexity of the next ordinals (sorry if i sound like AI ) However, there is way more after this point and the first one is called the Large Veblen Ordinal.
ω-1
All jokes aside, since EVERY number is closer to 0 than infinity (even the ill-defined ones) we cannot say things like the greatest finite number closer to infinity than zero although infinity-1 is technically a finite number.
Large Number Garden Number. It is not computable with any ordinal in the Fast Growing Hierarchy. Not even the Bashicu Matrix System. I can't even screenshot the full definition.
WHAT! THAT DEFINITION IS HUGE! Also, since LNGN isn't bigger than the Bachmann-Howard Ondinal, that takes LNGN's place as the closest known finite number other than (Omega minus whatever).