Fill in the blanks in the following proof, which shows that the sequence defined by the recurrence relation

sk = sk − 1 + 2k, for each integer k ≥ 1
s0 = 3.
satisfies the formula

sn = 3 + n(n + 1) for every integer n ≥ 0.

Proof (by mathematical induction):