recursive-fibonacci-generator-returns-list

def fibonacci(n):
    if n==0:
        return [0]
    elif n==1:
        return [0, 1]
    else:
        f = fibonacci(n-1)
        f.append(f[-1] + f[-2])
        return f

print(fibonacci(16))