MathNet 2013 Question 56

Sequence $(a_n)$ is defined recursively: $a_1 = 2$, $a_n = 2(n + a_{n-1})$ for $n \ge 2$. Prove that $a_n \lt 2^{n+2}$ for all $n \in \mathbb{N}$.