$$k_a(x)=\sum^\infty_{n=0}{\frac{n^2}{(n+x)!}}$$ $$k_b(x)=\sum^\infty_{n=0}{\frac{(n+x)^2}{n!}}$$ I noticed these functions closely relate to $e$. By looking at them I was able to determain a closed from for $k_b$. $$k_b(x)=e(x^2+2x+2)$$ Though I still have not found a short form for $k_a$. I do think it exists. Some integer inputs are as follows.
$k_a(0)=2e$
$k_a(1)=e-1$
$k_a(2)=2e-5$
$k_a(3)=5e-\frac{27}{2}$
Can any of you take a stab at it?
$$k_a(x)=\sum^\infty_{n=0}{\frac{n^2}{(n+x)!}}$$ In order to extend from $x$ integer to real : $(n+x)!=\Gamma(n+x+1)$ $$k_a(x)=\sum^\infty_{n=0}{\frac{n^2}{\Gamma(n+x+1)}}$$ Let : $\quad y(t)=\sum^\infty_{n=0}{\frac{t^n}{\Gamma(n+x+1)}}=e^tt^{-x}\left(1-\frac{\Gamma(x,t)}{\Gamma(x)} \right)$ $$\frac{dy}{dt}=\sum^\infty_{n=0}{\frac{nt^{n-1}}{\Gamma(n+x+1)}}=\left(e^tt^{-x}-xe^tt^{-x-1} \right)\left(1-\frac{\Gamma(x,t)}{\Gamma(x)} \right)- e^tt^{-x}\frac{1}{\Gamma(x)}\left(-e^{-t} t^{x-1} \right)$$ $$\frac{dy}{dt}=\sum^\infty_{n=0}{\frac{nt^{n-1}}{\Gamma(n+x+1)}}=e^t t^{-x-1}(t-x)\left(1-\frac{\Gamma(x,t)}{\Gamma(x)} \right)+\frac{t^{-1}}{\Gamma(x)}$$ $$g(t)=\sum^\infty_{n=0}{\frac{nt^{n}}{\Gamma(n+x+1)}}=e^tt^{-x}(t-x)\left(1-\frac{\Gamma(x,t)}{\Gamma(x)} \right)+\frac{1}{\Gamma(x)}$$
$$\frac{dg}{dt}=\sum^\infty_{n=0}{\frac{n^2t^{n-1}}{\Gamma(n+x+1)}}=e^t t^{-x-1}\left(x^2-2xt+t+t^2 \right)\left(1-\frac{\Gamma(x,t)}{\Gamma(x)} \right)-e^tt^{-x}(t-x)\frac{1}{\Gamma(x)}\left(-e^{-t} t^{x-1} \right)$$
For $t=1$ $$k_a(x)=\sum^\infty_{n=0}{\frac{n^2}{\Gamma(n+x+1)}}=e\,\left( x^2-2x+2\right)\left(1-\frac{\Gamma(x,1)}{\Gamma(x)} \right)+\frac{1-x}{\Gamma(x)}$$
Numerical tests are in agreement with this formula.
In addition :
CASE OF $x$ INTEGER $\qquad x=N$
$$\Gamma(N,1)=e^{-1}(N-1)!\:e_{_{N-1}}(1)=e^{-1}(N-1)!\sum_{k=0}^{N-1}\frac{1}{k!}$$ $(N-1)!\sum_{k=0}^{N-1}\frac{1}{k!}\quad$ is an integer. As a consequence $\quad e\,\frac{\Gamma(N,1)}{\Gamma(N)}$ is rational.
$$k_a(N)= \quad \begin{cases} \text{Irrational part }=(N^2-2N+2)\:e \\ \text{Rational part }= -\frac{N-1}{(N-1)!}-(N^2-2N+2)\displaystyle\sum_{k=0}^{N-1}\frac{1}{k!} \qquad\qquad N>0\end{cases}$$ This is in full agreement with the numerical table given by Claude Leibovici.