Fibonacci sequence: recursive form to expanded form.
New videos every week! Subscribe to Zak's Lab / @zakslab
Questions or requests? Post your comments below, and I will respond within 24 hours.
We use the recursive form of the Fibonacci sequence to write several terms of the expanded form of the sequence. This is simply a matter of plugging in values of "n" into the recursive formula to generate successive terms. One we get a good feel for the pattern, we can quickly generate more terms informally.