While there's a lot of ways to find a closed form for combinatoric sums (including the most practical one of looking the terms up in OEIS, as Claude Leibovici had), I'd like to remind the more general way of using generalized hypergeometric functions.
Even though the sum is finite, we can easily treat it as a particular case of hypergeometric series.
$$a_n(x)=\sum _{k=0}^{\lfloor n/2\rfloor} \frac{n!}{(n-2k)!} \frac{x^k}{k!}$$
Naming the general term $c_k$ we consider the ratio:
$$\frac{c_{k+1}}{c_k}=(n-2k)(n-2k-1) \frac{x}{k+1}=\left(k-\frac{n}{2} \right)\left(k-\frac{n-1}{2} \right)\frac{4x}{k+1}$$
$$c_0=1$$
Using this ratio, we can immediately write:
$$a_n(x)={_2 F_0} \left(-\frac{n}{2},-\frac{n-1}{2};;4x \right)$$
We consider the case:
$$a_n \left( \frac12 \right) ={_2 F_0} \left(-\frac{n}{2},-\frac{n-1}{2};;2 \right)$$
In Mathematica or Wolfram Alpha, we can evaluate this function using the code:
HypergeometricPFQ[{-n/2,-(n-1)/2},{},2].