Answer to Question #239429 in Python for bobo

Question

Fibonacci numbers are a sequence of integers, starting with 1, where the value of each number is the sum of the two previous numbers, e.g. 1, 1, 2, 3, 5, 8, etc. Write a function called fibonacci that takes a parameter, n, which contains an integer value, and have it return the nth Fibonacci number. (There are two ways to do this: one with recursion, and one without.)

Answer 1

def fibonacci(n)
    if n ==0:
         return 0
    elif n == 1:
         return 1
    else:
         return fibonacci(n-1) + fibonacci(n-2)