User blog comment:DrCeasium/Continued hyperfactorial array notation/@comment-25418284-20130327182149

Also, it's not too hard to find bounds. Using \(+^k\) for the order-k hyper operator (k - 2 arrows), \(n![k] < n +^k n\) is a very useful inequality (e.g. zootzootplex < ).