# Solution Review: Yield Fibonacci Sequence From 1st to Nth Number

This lesson discusses how you can use generators to return the first n terms of the Fibonacci sequence.

## We'll cover the following

## Solution:

The first and second terms of the Fibonacci sequence are 0 and 1 respectively. Each successive term in the sequence is then calculated by adding the two preceding terms. That is, the nth term is calculated by adding the (n-2)th and (n-1)th terms. Thus, we need to store the already computed sequence in a list to be able to calculate each new element in the sequence. The code snippet below uses this logic to return the Fibonacci sequence. Lines 12 and 13 simply use a for loop to print the first 8 terms in the sequence.

Get hands-on with 1000+ tech skills courses.