This is perhaps overkill but I think the maths is cute and it doesn't require any appeals to Stirling's approximation etc:
For $x = 4$,
$\displaystyle\sum\limits_{n=1}^{\infty} \frac{(n!)^2}{(2n)!}2^{2n}= \displaystyle\sum\limits_{n=1}^{\infty} \frac{(2n!!)^2}{(2n)!}$
$ \displaystyle\frac{(2n!!)^2}{(2n)!} = \frac{((2n)(2n-2)(2n-4)...(2))^2}{(2n)(2n-1)(2n-2)...(2)} = \frac{(2n)(2n-2)(2n-4)...(2)}{(2n-1)(2n-3)(2n-5)...(1)} = \prod_{i=1}^n{\frac{2i}{2i-1}}$
Now observe that $\displaystyle\prod_{i=1}^n{\frac{2i}{2i-1}} \ge 1$ $\forall$ $n$
And hence $\frac{(2n!!)^2}{(2n)!} \ge 1$ $\forall$ $n$
$\displaystyle\sum\limits_{n=1}^{k} \frac{(n!)^2}{(2n)!}2^{2n} \ge k $ and so certainly does not converge
For $x = -4$,
notice that the terms in the sum are exactly the same as before but with alternating signs. Furthermore:
$m > n \implies \displaystyle\prod_{i=1}^m{\frac{2i}{2i-1}} > \displaystyle\prod_{i=1}^n{\frac{2i}{2i-1}}$
Hence the terms of the series are increasing in absolute value and therefore do not converge to $0$. Thus the series does not converge (this reasoning equally applies to $x=4$).