Writing a recursive formula means to express the current element of the sequence, [tex]a_n[/tex], in terms of the previous elements:
[tex]a_n = f(a_{n-1},\ a_{n-2},\ldots,\ a_2,\ a_1)[/tex]
In this case, the sequence is quite simple, since each term only depends on the previous one. In particular, each term is 5 more than its predecessor, so we have
[tex]a_n=a_{n-1}+5[/tex]