Any techniques for deriving a closed form solution for the following recurrence relation? Or bounds on asymptotic behavior for large $n$?
$$a_{n+1,k} = \sum_{0 \le i \le n} \frac{n!}{i!} a_{i,k-1}$$
where $n,k \ge 0$ and $a_{0,0} = 0$
MathOverflow is a question and answer site for professional mathematicians. It only takes a minute to sign up.
Sign up to join this communityAny techniques for deriving a closed form solution for the following recurrence relation? Or bounds on asymptotic behavior for large $n$?
$$a_{n+1,k} = \sum_{0 \le i \le n} \frac{n!}{i!} a_{i,k-1}$$
where $n,k \ge 0$ and $a_{0,0} = 0$