I have the following sequence:
$$a(1) = 1$$ $$a(n) = a(n-1) + n$$
For example: $$a(1) = 1$$ $$a(2) =3$$ $$a(3) =6$$ $$a(4) =10$$ $$a(5) =15$$ $$a(6) = 21$$
Which approach should I use in order to find the formula for the sum of elements $a(1)$ through $a(n)$?
Thanks :)
These are known as the triangular numbers. You can rewrite this recurrence as $$a_n=\sum_{i=0}^n i={n+1 \choose 2}=\frac{n^2+n}{2}$$
The sum of triangular numbers yields the tetrahedral numbers who satisfy the equation $$T_n=\sum_{i=0}^\infty {n+1 \choose 2}=\frac{(n)(n+1)(n+2)}{6}$$
The derivation of this equation can be seen here