The sequence is defined recursively as follows:

• $a_1 = 2$
• $a_n = a_{n-1} + n$ for $n > 1$.

Steps to find the first four terms:

1. First term: $a_1 = 2$
2. Second term: $a_2 = a_1 + 2 = 2 + 2 = 4$
3. Third term: $a_3 = a_2 + 3 = 4 + 3 = 7$
4. Fourth term: $a_4 = a_3 + 4 = 7 + 4 = 11$

Result:

The first four terms of the sequence are: $2, 4, 7, 11$

Would you like to see a detailed explanation or generalization of this sequence?

---

Related Questions:

1. How can this sequence be represented explicitly?
2. What is the sum of the first $n$ terms of this sequence?
3. Can we prove that this sequence is arithmetic or not?
4. What are the next four terms of the sequence?
5. How does the growth of this sequence compare to other common sequences, like $n^2$ or $2^n$?

Tip:

Recursive sequences can often be transformed into explicit formulas by summing their differences systematically.