Question 1122871
<br>
This is simple if you understand what a recursive definition of a sequence is.<br>
By the way, the given definition is faulty; it tells us what a(1) is, and it tells us how to find a(n) for n greater than 2.  But it doesn't tell us how to find a(2).<br>
So the correct recursive definition would show<br>
a(1) = -5; a(n) = n+a(n-1) for n > 1  (not for n > 2)<br>
So the recursive definition first defines the 1st term: a(1) = -5.<br>
Then it tells you how to find each successive term ("a(n)") from the preceding term ("a(n-1)").  Specifically, it says that, for n > 1 the value of the next term is the current value of n ("n"), plus the value of the preceding term ("a(n-1)").<br>
So the value of a(2) is 2, plus a(1), or 2+(-5) = -3.<br>
Then similarly the value of a(3) is 3, plus a(2), or 3+-3 = 0.<br>
The problem only asks you for the first 4 terms, and I have found 3 of them for you.  It should be easy to find one more term in the sequence.<br>
However, if these recursive sequences are something new to you, I would recommend finding at least 3 or 4 more terms in the sequence, to give you a better feel for how recursive definitions work.