Let the sequence of numbers a(n) be given by the recurrence relation ak = ak-1 + 2k for k>=2 and a1 = 2. Show that an = n(n+1) for all n>=1.