Trintar

Trintar is equal to \(Tar(Tar(Tar(Tar))) = f_{\underbrace{C(C(\cdots(C(C(\Omega_{\text{Bintar}}2,0),0),\cdots ),0)}_{\text{Bintar C's}}}(\text{Bintar})\) where \(Tar(n) = f_{\underbrace{C(C(\cdots(C(C(\Omega_{n}2,0),0),\cdots ),0)}_{n\text{ C's}}}(n)\) and Tar = Tar(10) = Dekotar, using the fast-growing hierarchy with fundamental sequences for Taranovsky's notation.My system of number names (FGS) - Traveling To The Infinity The term was coined by wiki user Denis Maksudov.
== Etymology ==
The 3 parts of the name, "tri", "in" and "tar", mean 3, the "in-" operation and Tar function (from Taranovsky's notation) respectively, which form \(Tar(Tar(Tar(Tar)))\) when concatenated backwards. So the full name indicates how the number is constructed.
== Sources ==
== See also ==
Category:Numbers
Category:Numbers by Denis Maksudov
Category:10-based FGH numbers
Category:Higher computable level