How do you write a recursive formula

You need to show how a term of formula is based on a previous term.

For example, let's say you have the sequence 3, 6, 9, 12, ...
(multiples of 3).

As a regular function, you can have y = 3x, for the domain of all integers greater than 0. Since the domain is 1, 2, 3, 4, ..., when you multiply those numbers by 3, to get y, you generate the sequence.

To define the sequence recursively, you must base each new number on the previous number.

Start by stating the first term.

a1 = 3

If you look at the sequence, 3, 6, 9, ..., you see it has a constant difference, and it is an arithmetic sequence, so to generate a term, you need to add 3 to the previous term.

Once we defined the first term to be 3, the next term is a2 = 3 + 3 = 6
Then a3 = 6 + 3 = 9, etc.

To define the sequence recursively, just generalize the addition of 3 to a term to get the next term.

In all honesty, there really is no “work” per say to show. mainly it’s just using the process of elimination. the question is asking which domain(s) would be the most appropriate for the function c(n). n is the number of observed vehicles so right away, 1, 2, and 3 can be eliminated.why? 1, 2 start in the negatives and therefore it is impossible to observe negative cars. so, #4 would be the best answer to the given problem.

Answer: d. 48 step-by-step explanation: i used a calculator so i am 100% sure these are right   mark as brainliest?