User blog:Ynought/Hyper-extended expansion system

the extension is:arrays in the seperators

\(A\) is The n in [n]

\(B\) is the entry (a,b,c….,z)(up from one entry in the brackets)to the left of [n]

\(C_n\)is the \(n\) - th entry in \(B\)

\(D\) is the number of entries in the rightmost seperator of \(B\)

\(E_n\) is the n-th element in the array of the rightmost seperator in \(B\)

\(F\) is the system without the current \(B\)

Rules:

if \(E_D\)=1 then remove 1 now \(A^F\) now create \(A\) new entries that are the same as  \(B\)

'''if \(E_D\)≠1 then remove \(E_D\) but first \(B^H\) then create \(B\) new entries of value \(C\) with the \(E_D\) decremented by one then decrement the \(E_v\) where v = \(D\)-1  now \(A^F\) then create \(A\) new entries of value \(B\)... keep going like this until \(E_D\) is reduced to one entry '''