User blog comment:Wythagoras/Proof that TREE(n+1) divided by TREE(n) is strictly increasing/@comment-223.255.230.227-20141220074940/@comment-10429372-20141220080209

@Wikia contributor 1: Using the data above it isn't too hard to proof that TREE(n) > TREE(n-1)^TREE(n-1).

@Wikia contributor 2: No. There are rows Un such that Un is strictly increasing, while for every n Un < U(n-1)^3