User blog:VoidSansXD/Mega Recursive Notation: Part 1

Rules:

Rules:

1.)  n(1) = n+1

2.)  n(x) = n+x

3.)  n[1] = n(1)

4.)  n[2] = n(n(n(n(n(........n(1)))...)))) with n n's.

5.)  n[3] = n(n(n(n(n(n(n(.......n(1)))))))...))))) with n(n(n(n(n(n(n(n(n(n.......n(1))))....))))) (with n(n(n(n(n(n(n(......(n(1))))....)))) (with.... (n times)

6.)  n[4] = n(n(n(n(n(n(n(.......n(1)))))))...))))) with n(n(n(n(n(n(n(n(n(n.......n(1))))....))))) (with n(n(n(n(n(n(n(......(n(1))))....)))) (with.... (n(n(n(n(n(n(n(.......n(1)))))))...))))) with n(n(n(n(n(n(n(n(n(n.......n(1))))....))))) (with n(n(n(n(n(n(n(......(n(1))))....)))) (with.... (n n(n(n(n(n(n(n(.......n(1)))))))...))))) with n(n(n(n(n(n(n(n(n(n.......n(1))))....))))) (with n(n(n(n(n(n(n(......(n(1))))....)))) (with.... (n...........times)times)times)times)times)times)times....times)))))....)))), and n amounts of "times".

7.)  n[5] =  n(n(n(n(n(n(n(.......n(1)))))))...))))) with n(n(n(n(n(n(n(n(n(n.......n(1))))....))))) (with n(n(n(n(n(n(n(......(n(1))))....)))) (with.... (n(n(n(n(n(n(n(.......n(1)))))))...))))) with n(n(n(n(n(n(n(n(n(n.......n(1))))....))))) (with n(n(n(n(n(n(n(......(n(1))))....)))) (with.... (n n(n(n(n(n(n(n(.......n(1)))))))...))))) with n(n(n(n(n(n(n(n(n(n.......n(1))))....))))) (with n(n(n(n(n(n(n(......(n(1))))....)))) (with.... (n...........times)times)times)times)times)times)times....times)))))....)))), and n(n(n(n(n(n(n(n(.......n(1)))))))...))))) with n(n(n(n(n(n(n(n(n(n.......n(1))))....))))) (with n(n(n(n(n(n(n(......(n(1))))....)))) (with.... (n(n(n(n(n(n(n(.......n(1)))))))...))))) with n(n(n(n(n(n(n(n(n(n.......n(1))))....))))) (with n(n(n(n(n(n(n(......(n(1))))....)))) (with.... (n n(n(n(n(n(n(n(.......n(1)))))))...))))) with n(n(n(n(n(n(n(n(n(n.......n(1))))....))))) (with n(n(n(n(n(n(n(......(n(1))))....)))) (with.... (n...........times)times)times)times)times)times)times....times)))))....)))), and  n(n(n(n(n(n(n(.......n(1)))))))...))))) with n(n(n(n(n(n(n(n(n(n.......n(1))))....))))) (with n(n(n(n(n(n(n(......(n(1))))....)))) (with.... (n(n(n(n(n(n(n(.......n(1)))))))...))))) with n(n(n(n(n(n(n(n(n(n.......n(1))))....))))) (with n(n(n(n(n(n(n(......(n(1))))....)))) (with.... (n n(n(n(n(n(n(n(.......n(1)))))))...))))) with n(n(n(n(n(n(n(n(n(n.......n(1))))....))))) (with n(n(n(n(n(n(n(......(n(1))))....)))) (with.... (n...........times)times)times)times)times)times)times....times)))))....)))), and .......... amounts of "times" amounts of "times".......a total of n amounts of "n amounts of "times""

8.)  Anymore writing would get EXTREMELY SLOPPY AND LONG, and you probably get the jist of it by now.  n[x] is ALOT bigger than n[x-1].

That's the end of part one of the mega recursive function/notation, growth rates would be helpful. Thanks!