AMHAN (Alemagno's Hyper Array Notation) is based off BHAN. It has similar expressions, but a stronger growth rate. A much stronger growth rate.
N<n> = n^n. n is called the base.
An array is represented by an uppercase letter, usually A.
N<n,1> = N<n>
N<n,m,A> = Xn, where X1 is N<n,m-1,A> and Xa is N<Xa-1,m-1,A>
m is called the nester. m is the first entry of any array.
Now, let's look at the arrays. If you find an E(A), then solve A.
1,x,A = n,x-1,A
A,1 = A
Else, 1,A = 1,E(A)
The comma is a shorthand for (1). N<n(A)B> is a shorhand for N<n,1(A)B>.
(x) works the same as the comma, except that 1(a)b = 1(a-1)1(a-1)..(a-1)1(a-1)1(a)b-1.
And 1(A)B = 1(E(A))2(A)B.
Then, (1\1) = (1) = the comma, (1\a) = (1(1(...\a-1)2\a-1)2\a-1) (nested n times), and #1\a (Where # is rest of array) = #1(#1(#...\a-1)2\a-1)2\a-1
Then, (x)\ work like (x), but (1)\ = \. Then, \ = \_1, \_a work like \ but using (x)\_a-1, and (x)\_a work like (x) but (1) = \_a.
We are not done yet. Let \^1_0 work like \ but... coming soon.