Prove using induction that $1^2 + 3^2 + 5^2 + . . . + (2n + 1)^2 = (n + 1) ∗ (2n + 1) ∗ (2n + 3)/3$ My question reads as follows: 
Prove using induction that
$$1^2 + 3^2 + 5^2 + . . . + (2n + 1)^2 = (n + 1) \times (2n + 1) \times (2n + 3)/3.$$
Firstly, I must prove the base case. For $n=0$, my LHS $= 1$ and my RHS $= 1$. Perfect, I've proven the base case.
I must now assume that $n=k$ for some arbitrary $ k\geq 0$. 
Secondly, I must assume the induction hypothesis which states that
$S(k) = (k+1)(2k+1)(2k+3)/3$. 
We want to prove that for some arbitrary $k$, the predicate of $k+1$ also holds true.
I get to this point and everything is fine until I am unable to return an answer that matches my presumed $S(k+1)$. My answer must be done in this format in order to get full marks.
So far what I have is the following:
In order to get the $(k+1)$th term, we must add the $(k+1)$-th term to the series. Therefore it looks like the following:
$$1^2 + 3^2 + 5^2 + ... + (2k+1)^2 + \mathbf{(2k+3)^2}$$
By substituting in $S(k)$ we get the following:
$$(k+1)(2k+1)(2k+3)/3 + (2k+3)^2$$
It is here that I encounter an issue. No matter which simplification techniques I use, after this step I can never return an answer that is $(k+2)(2k+3)(2k+5)/3$ so I am stuck. And unfortunately, I am not allowed to then assume we can rewrite the series in terms of $(2k-1)^2$ which would make things too easy and I could easily get back the right-hand equivalent to that. In desperate need of help. Thanks.

$\begin{align}\frac 13 (k+1)(2k+1)(2k+3)+(2k+3)^2&=\frac 13(2k+3)\bigg((k+1)(2k+1)+3(2k+3)\bigg)
\\&=\frac 13(2k+3)\bigg(2k^2+3k+1+6k+9\bigg)
\\&=\frac 13(2k+3)\bigg(2k^2+9k+10\bigg)
\\&=\frac 13(2k+3)(k+2)(2k+5)
\end{align}$
