Program: 131

Write a recursive function to obtain the first 25 numbers of a Fibonacci sequence. In a Fibonacci sequence the sum of two successive terms gives the third term.

Following are the first few terms of the Fibonacci sequence:
1 1 2 3 5 8 12 21 34 55 89

How to use recursion to get the Fibonacci series.

Output:

Enter number: 25
Fibonacci Series:
0
1
1
2
3
5
8
13
21
34
55
89
144
233
377
610
987
1597
2584
4181
6765
10946
17711
28657
46368