Ask your own question, for FREE!
Mathematics 9 Online
OpenStudy (anonymous):

What is the recursive formula for fibonacis (not sure one the spelling here) sequence. The sequence goes like this 1,1,2,3,5,8,13,21,34,55...

OpenStudy (anonymous):

\[F _{n} = F _{n - 1} + F _{n - 2}\]

OpenStudy (anonymous):

\[F _{o} = 0, F _{1} = 1\]

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!