Next
1. Print 1 to N Recursively2. Factorial Using Recursion3. Print N to 1 Recursively4. Even Numbers 1-N Recursively5. Odd Numbers 1-N Recursively6. Sum of First N Natural Numbers Recursively7. Power x^n Recursively8. Nth Fibonacci Recursively9. Fibonacci Series Recursively10. Sum of Digits Recursively

Fibonacci Series Recursively

Print Fibonacci series up to n terms recursively.

IntermediatePhase 3 - Level 1: Basic RecursionExample 9 of 10
fibonacci-series-recursively.py
1def fibonacci(n):
2    if n == 0:
3        return 0
4    if n == 1:
5        return 1
6    return fibonacci(n - 1) + fibonacci(n - 2)
7

8# Print series
9n = int(input("Enter number of terms: "))
10for i in range(n):
11    print(fibonacci(i), end=" ")
12print()

Output

Enter number of terms: 8
0 1 1 2 3 5 8 13

What's going on

Call fibonacci function for each index.

Key Concepts:

Loop from 0 to n-1
Call fibonacci(i) for each
Print each term

🔗Related Content

PreviousNth Fibonacci RecursivelyNextSum of Digits Recursively