Fibonacci Series using recursion.

Fibonacci Series using recursion

In Python the Fibonacci numbers, commonly denoted Fn form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. Here is the example of Fibonacii Series using Recursion in Python.

Fibonacii using Recursion in Python

Thank you, your comments are appreciated.