Is there a closed form for
$$\sum_{j = 0}^k \frac{j}{(k-j)!}$$
for $k \in \mathbb{N}$.
I did not find any closed form.
However, computing $$S_k=\sum_{j = 0}^k \frac{j}{(k-j)!}$$ for $(0 \leq k \leq 1000)$, it seems to be very close to $e(k-1)$. $$\left( \begin{array}{cccc} k & S_k & S_k \approx & e(k-1) \\ 5 & \frac{87}{8} & 10.87500000 & 10.87312731 \\ 10 & \frac{8877691}{362880} & 24.46453649 & 24.46453646 \\ 15 & \frac{3317652307271}{87178291200} & 38.05594560 & 38.05594560 \\ 20 & \frac{42739099682215483}{827517689856000} & 51.64735474 & 51.64735474 \end{array} \right)$$
Reversing the order of the sum (i.e. replacing $j$ with $k-j$ everywhere) gives $$ S_k = \sum_{j=0}^k \frac{j}{(k-j)!} = \sum_{j=0}^k \frac{k-j}{j!} = k\sum_{j=0}^k \frac{1}{j!} - \sum_{j=1}^k \frac{1}{(j-1)!}. $$ Now, using that $\sum_{j=0}^k \frac{1}{j!} = e \frac{\Gamma(k+1,1)}{\Gamma(k+1)}$ we recover $$ S_k = e \frac{\Gamma(k+1,1) - \Gamma(k,1)}{\Gamma(k)}. $$
Maple gives ${\frac {1+ e(k-1) \Gamma \left( k,1 \right) }{\Gamma \left( k \right) }} $