The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

A230418

a(n) = the least k such that after having climbed k steps up from the root of the infinite trunk of the factorial beanstalk we have reached integer which is at least n.