A formula is recursive if it expresses the term
in terms of the previous one(s) 
In this case, every term is 7 more than the previous one, so the formula for
will only involve
:

In fact, this formula is simply saying: for every index
, the term with that index is 7 more than the term before.
Also, we have to specify the starting point (otherwise we would go backwards indefinitely), so the complete recursive formula is

which means: start with 2 and generate every other term by adding 7 to the previous one.
Answer:
Hope the picture will help you
Answer:
the answer is b
Step-by-step explanation:
This might help explain how to do a very similar problem.... http://www.mathopenref.com/constbisectline.html
132 children + 61 children = 193 children
Unless some of the children who went on Sunday also went on saturday.