Define a recursive sequence and its relationship to a Fibonacci sequence.

asked Feb 20, 2022 83.0k views

0 votes

7.4k points

Please log in or register to add a comment.

5 votes

answer: The recursive definition for generating Fibonacci numbers and the Fibonacci sequence is: fn =fn-1 + fn-2 where n>3 or n=3

explanation: i think thats the answer

Oliver Apel answered Feb 25, 2022

6.4k points

Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

7.8m questions

10.5m answers