Here is a function I made called Ictation.
Basic Rule[]
Start with ict(n). We will be adding subscripts later. pentate n to 2. This equates to n^n^n^n ... with n amount of n's Lastly, add all natural numbers less than or equal to the new value.
Here are the first few values:
ict(1) | 1 |
ict(2) | 10 |
ict(3) | 2.907486850152384 × 1025 |
ict(4) |
101.614460945205645 × 10154 |
ict(5) | 10101.3357404838712281 × 102184 |
ict(6) | 1010102.069197375635296 × 1036305 |
Constant Subscripts[]
Now, let's add subscripts!
No subscript defaults to a 1. ict(n) = ict1(n)
We know that addition is the first hyperoperator, and multiplication is the second. So, when there is a 2 as the subscript, you multiply all of the numbers instead of adding. This pattern continues will all natural numbers.
Omega In the Subscript[]
ictω(n) = ictn(n)
ictω+1(n) = ictn+1(n)
ictω*2(n) = ict2n(n)
ictω2(n) = ictn2(n)
Epsilon[]
Soon