# Python program to display the Fibonacci sequence up to n-th term using recursive functions,

def recur_fibo(n):

def recur_fibo(n):

"""Recursive function to print Fibonacci sequence""" if n <= 1:

return n

else:

return(recur_fibo(n-1) + recur_fibo(n-2))

# Change this value for a different result

nterms = 10

# uncomment to take input from the user

#nterms = int(input("How many terms? "))

# check if the number of terms is valid

if nterms <= 0:

nterms = 10

# uncomment to take input from the user

#nterms = int(input("How many terms? "))

# check if the number of terms is valid

if nterms <= 0:

print("Plese enter a positive integer")

else:

print("Fibonacci sequence:")

for i in range(nterms):

for i in range(nterms):

**Output:**

Fibonacci sequence:

0

1

1

2

3

5

8

13

21

34

0

1

1

2

3

5

8

13

21

34

ReplyDeletenice article for beginners.thank you.

javacodegeeks

welookups python