# ChapterRecursion/fibo.py
# Fibonacci sequence 
# 1  1  2  3  5  8  13  21  34  55  89  144  233  377  610  

def fib(n):    # find  Fibonacci's n number
    if ( n == 0 or n == 1):
        return 1
    else:
        return fib(n-1) + fib(n-2)

def fib2(many): # write Fibonacci series up to n
    result = []
    for i in range(many):
        print(fib(i),' ',end="")

fib2(15)