User blog comment:Simply Beautiful Art/A better lower bound to f k in the fast growing hierarchy/@comment-11227630-20180118040916

Compared with arrow notation, $$n\uparrow^{m-1}(n+1)<f_m(n)<(n+1)\uparrow^{m-1}(n+1)$$ for $$m\ge4$$