Asymptotic of the number of partitions of $n$ into numbers from $\{1, 2, \dots, k\}$

Question

How to find the asymptotic behavior ($n \to +\infty$) of the number $q(n, k)$ of partitions of $n$ into addends from $\{1, 2, \dots, k\}$?

I proved that $q(n, k)$ satisfies the recurrent relation $q(n, k) = q(n - k, k) + q(n, k - 1)$ for $n \geq k$. How can I find asymptotic then? Any help would be appreciated.

Answer 1

See this wikipedia article. for all you wanted to know.

Edit I misread the question as restricting both the size and the number of components, but you are only restricting one of them (it does not matter which, you get the same result). The question has a nice discussion (with a discussion of asymptotics) in this paper by Rodney Canfield.