While working on this question I think I've found a closed-form expression for the following series, but I don't know how to prove it.
Let $a \in \mathbb{N}$ and $b \in \mathbb{R}$. Then
$$\sum_{k=0}^{\infty} \frac{k^a\,b^k}{k!} \stackrel{?}{=} e^b \sum_{j=0}^a S(a,a-j+1)\,b^{a-j+1}, \tag{1}$$
where $e$ is Euler's number and $S(n,k)$ are the Stirling numbers of the second kind, defined as
$$S(n,k) = \frac{1}{k!}\sum_{i=0}^k (-1)^{i}{k \choose i} (k-i)^n,$$
with ${n \choose k}$ a binomial coefficient.
I have three questions.
- $1^\text{st}$ Question. Is $(1)$ true?
- $2^\text{nd}$ Question. If $(1)$ is true, then can we write $(1)$ into a more compact form with solving the finite sum somehow?
- $3^\text{rd}$ Question. If $(1)$ is true, then can we generalize the statment for $a \in \mathbb{R}$? I don't know about this kind of generalization of the Stirling numbers of the second kind. Maybe there is another approach?
Notice that
$$x^m e^x = \sum_{k=0}^\infty \frac{1}{k!} x^{m+k} = \sum_{j = m}^\infty \frac{1}{(j-m)!} x^j$$
So we have
\begin{align*} \sum_{k=0}^\infty \frac{k^m}{k!} x^k &= \sum_{k=0}^{m-1} \frac{k^m}{k!} x^k + \sum_{k=m}^\infty \frac{k^m}{k!} x^k \\ &= \sum_{k=0}^{m-1} \frac{k^m}{k!} x^k + \sum_{k=m}^\infty \frac{1}{(k-m)!} x^k \\ &\qquad \qquad+ \sum_{k=m}^\infty \frac{k^m - k(k-1)\cdots(k-m+1)}{k!} x^k \\ &= x^m e^x + \sum_{k=0}^{m-1} \frac{k^m}{k!} x^k +\sum_{k=m}^\infty \frac{k^m - k(k-1)\cdots(k-m+1)}{k!} x^k \\ \end{align*}
Inducing on $m$, you should be able to write the remaining sums in terms of things you already know.