The gooboldex is equal to {10, {10, {10, … {10, 100 (1) 2} (1) 2} (1) 2} … (1) 2} (goobol times). The term was coined by HaydenTheGoogologist2009.[1]
Approximations[]
| Notation | Approximation |
|---|---|
| Bowers' Exploding Array Function | \(\lbrace10,\text{goobol}+1,2(1)2\rbrace\) |
| Bird's array notation | \(\lbrace10,\text{goobol}+1,2[2]2\rbrace\) |
| DeepLineMadom's Array Notation | 10[2{2}2](goobol + 1) |
| Cascading-E notation | \(E100\#\text{^}\#100\#(2+E100\#\text{^}\#99)\) |
| Hyperfactorial array notation | \(100![\text{goobol}+2,1,1,2]\) |
| Strong array notation | s(10, goobol + 1, 2 {2} 2) |
| Fast-growing hierarchy | \(f_{\omega^{\omega}}^{f_{\omega^{98}}(100)}(100) \approx f_{\omega^{\omega}+1}(f_{\omega^{\omega}}(100))\) |
| Hardy hierarchy | \(H_{\omega^{\omega^{\omega}}}^{H_{\omega^{\omega^{98}}}(100)}(100)\) |
Sources[]
- ↑ Hayden's Big Numbers - Goobol series. Retrieved 2022-09-12.