Welcome to the forums, mate.
Ok, so you've proved the base case. Now we assume that n=k is true, that is,
where is an integer.
This can be rewritten as
Now consider n=k+1
(by induction hypothesis)
But you know that is always even. So you can say that where l is an integer.
so you're left with . Thus it is divisible by 8.