Write on my own my first mathematical induction proof I am trying to understand how to write mathematical induction proofs. This is my first attempt.
Prove that the sum of cubic positive integers is equal to the formula 
$$\frac{n^2 (n+1)^2}{4}.$$ I think this means that the sum of cubic positive integers is equal to an odd number. However, let's go on proving...
1) I start by proving the base case $n=1$ and I show that the formula holds.
2) I assume than any number $k$ other than $1$, which appartains at $N$, holds for the formula and I write the same formula but with $k$ which replaces $n$.
3) For mathematical induction, I assume that the formula holds also for $k+1$ = $n$ 
So, the left side of the equation should be:
$$\sum^{k+1}_{i=1} i^3 = 1^3 + 2^3 + 3^3 + ... + (k+1)^3$$
I am wondering about which one of these 2 forms (equivalents, I think) should have the right side :
this one, with $k+1$ in place of the $n$ of the original formula / or $k$ in the second version:  $\frac{(k+1)^2[(k+1)+1]^2}{4}$  or this one: $\frac{k^2(k+1)^2 }{4} + (k+1)^3$ ?
I think that, in order for the proof to be convincing, we should write an equivalent statement for the original form of the formula, namely $$\sum^{n}_{i=1} i^3= \frac{n^2(n+1)^2}{4}$$ and perhaps we do it by showing that after algebraic passages $\frac{k^2(k+1)^2 }{4} + (k+1)^3$ is equal to $\frac{(k+1)^2[(k+1)+1]^2}{4}$ ?
Sorry for my soliloquy but it helps to understand and I would appreciate confirmation from you!

It seems your issue is more conceptual than algebraic since you're stuck about which form of right hand side to use.
A proof by induction on a sum formula works by showing: (1) it holds in the base case, when the index is at its minimum; and (2) if it applies for the $n=k$ case, then it will also hold for the $n=k+1$ case.
With these two in hand we prove that the formula holds at any index. For example, we know it holds at $k=10$ because it holds at $k=1$ (via (1)) which implies it holds at $k=2$ (via (2)) which implies it holds at $k=3$ (via (2) again), and so on, repeatedly applying (2) until we reach 10.
We want to show that "the formula applies at $k$" implies that the formula holds at $k+1$, so our target is showing that $\sum_{i=1}^{k+1}i^3 = \frac{(k+1)^2((k+1)+1)^2}{4}$ and our ammunition is our assumption that $1^3+\ldots+k^3=\frac{k^2(k+1)^2}{4}$.
To connect the two, we notice that the left side of our target nests our assumption -- $\sum_{i=1}^{k+1}i^3 = (1^3+\ldots+k^3)+(k+1)^3$.
The rest is algebra.
