We denote $V_n(z) = U_{n+1}(z, -1)$ for all $z \in \mathbb{C}$ and $n \in \mathbb{N}$, where $U(a,b) = (U_n(a,b))_{n \in \mathbb{N}}$ is the unique sequence satisfying $E_{a,b}$ with initial conditions $U_0(a,b) = 0$ and $U_1(a,b) = 1$.\\
Show that, for all $z \in \mathbb{C}$ and $n \in \mathbb{N}$, we have
$$V_n(z) = \sum_{j=0}^{\lfloor n/2 \rfloor} \binom{n-j}{j} (2z)^{n-2j} (-1)^j$$
One may proceed by induction.