Your base case is good, although it should be "for n = 2".
The inductive step should say: suppose it's true for some n ≥ 2. We'll show it's true for n+1. Now we check:
(n+1)^3-(n+1) = n^3+3n^2+3n+1-n-1 = (n^3-n)+3(n^2+n)
By assumption, 6 divides n^3-n. 3 clearly divides 3(n^2+n), and 2 divides n^2+n since if n^2 has the same parity as n, and hence their sum is even. So 6 divides 3(n^2+n), and 6 divides (n+1)^3-(n+1).
There we go!