Proof by induction that $1^2 + 3^2 + 5^2 + ... + (2n-1)^2 = \frac{n(2n-1)(2n+1))}{3}$ I need to know if I am doing this right. I have to prove that 
$1^2 + 3^2 + 5^2 + ... + (2n-1)^2 = \frac{n(2n-1)(2n+1))}{3}$
So first I did the base case which would be $1$.
$1^2 = (1(2(1)-1)(2(1)+1)) / 3
1 = 3/3
1 = 1$ Which is right.
Then I assumed true for k so
$1^2 + 3^2 + 5^2 + ... + ((2k-1)^2 = k(2k-1)(2k+1)) / 3$
This is where I get lost. I know that the next step is to prove its true for k+1, but I am lost on what to do here. Do I actually simplify down what I assumed true for k? Am I right so far?

This is not a proof by induction, but is included for information of those who might be interested. 
Note that
$$r^2=\binom r2+\binom {r+1}2$$
Hence
$$\begin{align}
&\color{blue}{1^2}+\color{purple}{3^2}+\color{green}{5^2}+\cdots+\color{red}{(2n-1)^2}\\
&=\color{blue}{\binom 12+\binom 22}+
\color{purple}{\binom 32+\binom 42}+
\color{green}{\binom 52+\binom 62}+\cdots +
\color{red}{\binom {2n-1}2+\binom {2n}2}\\
&=\sum_{r=1}^{2n}\binom r2\\
&=\binom {2n+1}3
=\frac {n(2n-1)(2n+1)}3\qquad\blacksquare\end{align}$$
