An improved version of Googolological notation

### Two entry arrays Edit

First if all {a,b} is equal to a^^^b.

### Multi-entry arrays Edit

Multi-entry arrays are solved recursively: {...,a,b} = {{...,a},b}.

### Square brackets Edit

[a,b] is equal to {a,a,...,a,a} with b a's

Square brackets can also be multi-entry arrays. Solve them like normal arrays

### Higher levels Edit

[...] becomes {...}_{2}.

Then we define {...}_{3}, it is to [...] as [...] is to {...}.

### The f function Edit

f(n) = {n,n}_{n}.