write a recursive formula for 1,6,11,16

Answer 1

Looks like each term is 5 more than the previous term, so
term(1) = 1
term(n) = term(n-1) + 5 , for all n > 1 , n ∈ N