User blog:VoidSansXD/Mega recursive function part 5

Rules:

1.)  n;;1;a = n;n;n;n;n;n;n;n;n.....n;n;n;n;n;n;1;n;n;n;n;n;n;n......n;n;n;n;n;n;n with a n's.

2.)  n;;2;a = n;n;n;n;n;n;n;n;n.....n;n;n;n;n;n;1;n;n;n;n;n;n;n......n;n;n;n;n;n;n with (n;n;n;n;n;n;n;n;n.....n;n;n;n;n;n;1;n;n;n;n;n;n;n......n;n;n;n;n;n;n with a n's) n's.

3.)  n;;;1;a = n;;n;;n;;n;;n;;n;;n;;n......n;;n;;n;;n;;n;;1;;n;;n;;n;;n;;.........n;;n;;n;;n;;n;;n;n with a n's.

4.)  Pattern repeats.

5.)  n--x,n--a = n;;;;;;.....;;;;n;a with x ;'s.

6.)  n---x,n---a = n--((....(((((n--x,n--a, (n--x,n--a)..........n--x,n--a), n--a with a nests.

7.)  Pattern repeats

8.)  Eventually, multiple symbols will appear.  n'0'a = n(1), n'1'a = n;;1;a.  n'2'a = n--x,n--a, etc.

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