User blog comment:Syst3ms/Breadth-Recursive Array Notation (BRAN)/@comment-25601061-20180424215049/@comment-35392788-20180425190855

Wow, that's awesome. Thanks for all the insight ! Anyway, being able to express Graham's Number with only 4 entries is pretty powerful.

Now, if that's not too much, I'd want to ask about the growth rates of the 2 following functions :

f(n) = B(n,n,n,n)

g(n) = B(n,n,n,...,n,n) with n n's