Tetration Tower Notation is defined below. (Edit. Sorry for the title, I could not change it. It is now called Tetration Tower Notation.)
For array (a,b,c,d,e,f,g,h,i,j,...*,#)## it is computable by the following. Take the last number, and make a tetriation tower using all the other numbers backwards from * all the way to a, with # being the base of the tetriation tower, with ## arrows(where ## is any real integer) between each of the numbers in the tetriation tower. Then the number is calculated assuming we put parentheses between the last 2 numbers of the tetriation tower and always solve the operation of the last 2 numbers in every step of computing.
Here is an example. (3,6,9)3 is definable in my array function as \(9\uparrow\uparrow\uparrow (6\uparrow\uparrow\uparrow 3\))
It starts from 9 and goes to 3, with 3 arrows between each number. We first solve \(6\uparrow\uparrow\uparrow 3\) due to the fact that 6 and 3 are the last 2 numbers in the backwards tetriation tower with 3 following 3 arrows following 6 since 3 is the number after the parentheses closes. Then we have to do \(9\uparrow\uparrow\uparrow (6\uparrow\uparrow\uparrow 3\)) to put 9 with 3 arrows to the result of \(6\uparrow\uparrow\uparrow 3\)
Side Note: Everyone is welcome to make numbers using my Tetriation Tower Notation.