Recursionhard
0:00.0

A recurrence relation an=an1+an2a_n = a_{n-1} + a_{n-2} with a0=0,a1=1a_0=0, a_1=1 counts Fibonacci numbers. What is the generating function A(x)=n=0FnxnA(x) = \sum_{n=0}^{\infty} F_n x^n?