recurrence relation

I am having trouble with the problem: If a(n+1)=a(n)+.5n, with a(0)=2, then find a(1), a(2), a(3), a(4), and a(5).

Would you please help me understand what to do here, or maybe work some examples in class. Thank you.

If you let n = 0 you get

a(0 + 1) = a(0) + .5 * 0 = 2 + 0 = 2.

Then letting n = 1 you get

a(1 + 1) = a(1) + .5 * 1 = 2 + .5 = 2.5.

Then letting n = 2 you get

a(2 + 1) = a(2) + .5 * 2 = 2.5 + 1 = 3.5.

Then letting n = 3 you get

a(3 + 1) = a(3) + .5 * 3 = 3.5 + 1.5 = 5.

You continue the process as long as necessary.