Save up to $499! Grab all Python courses for $49 or all online courses we’ve ever launched for only $169. Only Feb 11-16. Happy Valentine's!
Introduction
Quiz
9. Simple recursive CTEs
Summary

Instruction

Ok. Let's move on to recursion and start with something simple.

Exercise

Fibonacci numbers are numbers that follow the pattern given below:

F(n) = F(n-2)+F(n-1)

Each Fibonacci number is the sum of the two previous Fibonacci numbers. The first two Fibonacci numbers are 0 and 1.

Print a single column that will show all Fibonacci numbers smaller than 100. Name the column Fib.