Fix positive integers $m,n$. Consider values that can be expressed as a sum
$$x_1 + {x_2 \over 2} + {x_3 \over 3} + \cdots + {x_n \over n}$$
where each $x_i$ ranges over the set $\{0,1,2,3,\dots,m\}$. How many different such values are there?
Let $f(m,n)$ denote the number of such values -- I'm wondering if I can get a crude asymptotic estimate for $f(m,n)$. The application is for an algorithm in computer science, so I'm most interested in whether it grows exponentially fast or polynomially fast. In particular, for fixed constant $c_1$, assuming $m \le n^{c_1}$, does $f(m,n)$ grow exponentially fast (there is $c_2$ such that $f(n^{c_1},n) \ge e^{c_2 n}$ for sufficiently large $n$)? I suspect it does but can't see how to approach the problem.