Respuesta :
Answer:
D).
Step-by-step explanation:
I took the test and got a 100 :)
Formula D. a1=2 an=an-1+3 can be used to represent the sequence 2,5,8,11,14.
What is recursive?
Recursion is the procedure of repeating items in a self-comparable way. In programming languages, if software lets in we call a characteristic within the identical characteristic, it is referred to as a recursive call of the feature.
explanation:
The first number is 2
The next number is 5
it follows interval is 3. so the sequence is 2, 5,8,11, 15...and so on.
The classic instance of recursive programming involves computing factorials. The factorial of various is computed as that wide variety times all of the numbers beneath it as much as and inclusive of 1. as an
For example, factorial(5) is similar to 5!4!×3!2!1, and factorial(three) is three!2!1.
Learn more about recursive formulas here:-https://brainly.com/question/1275192
#SPJ2