斐波那契数列
def fib(n):
    if n <= 1:
        return n
    else:
        return fib(n - 1) + fib(n - 2)

def run(n):
    fib_list = []
    for i in range(0, n + 1):
        fib_list.append(fib(i))
    return fib_list

f=run(10)
print(f)