Question

"Write a recursive formula for the following sequence in

FUNCTION NOTATION FORM.
1, 4, 7, 10, 13........"

Answer 1

A recursive formula for the arithmetic sequence 1, 4, 7, 10, 13... in function notation form is f(1) = 1 for the first term and f(n) = f(n-1) + 3 for each subsequent term (n > 1).

Step-by-step explanation:

To write a recursive formula for the given sequence in function notation form, we first need to identify the pattern of the sequence. The sequence is 1, 4, 7, 10, 13..., and it increases by 3 with each term. This is an arithmetic sequence. To express the nth term f(n), we can use the following recursive formula:

f(1) = 1 (The first term of the sequence)

For n > 1:

f(n) = f(n-1) + 3

This means that each term is the previous term plus 3.