User blog comment:Ikosarakt1/Inverse busy beaver function/@comment-27014275-20151012075115/@comment-1605058-20151012075815

If by inverse of this function you mean the least k with $$\Sigma^{-1}(k)=n$$ then this inverse is upper bounded by the number of $$n$$-state machines, which isn't that fast-growing.