User blog:VoidSansXD/Mega Recursive notation: Part 4

Rules:

1.)  n<<1>a = na

2.)  n<<2>a = na

3.)  Same recursion rules as part 3, n<<<1>a, n<<a, etc.

4.)  n/a\a = n<<<<<<....<<<<a with n <'s.

5.)  n//1\a = n/a\a, etc.

6.)  Eventually, we'll run out of symbols, so we have to LABEL the symbols.  n;0;a = n(1), n;1;a = n[1], n;2;a = n{{?1}a, n;3;a = n<1>a, etc.  Eventually, we'll reach n;x;a.

That's the end of part 4, growth rates would be appreciated. Thanks!