Write a recursive code to compute the nth Fibonacci number.

def fibonacci(a,b,number,limit) :
   if(limit==0):
      return number
   else:
      a=b
      b=number
      number=a+b
      fibonacci(a,b,number,limit-1)
 
# main program  
a=0
b=1
number=0
limit=int(input('enter nth term to find '))
number=fibonacci(a,b,number,limit)
print(number)
 
Explanation: In this program we have defined a Recursive function named fibonacci. in the main program we are getting the limit of number from user in limit variable. number will store the result from function. In the function we are checking if limit is 0 we will return the number to main program, otherwise fibonacci logic is continued. function is calling itself until limit becomes 0.
 
We are decreasing limit each time function is called. when the limit is zero logic will end nth fibonacci number is returned. finally we are printing number.