MathCastle
Counting & ProbabilityEasyRecursion, Catalan Numbers & Generating Functions

Recursion, Catalan Numbers & Generating Functions · Easy problem

The Fibonacci numbers satisfy fn=fn−1+fn−2f_n=f_{n-1}+f_{n-2}. Given f7=13f_7=13 and f8=21f_8=21, find f9f_9.