斐波那契数列（Fibonacci sequence）递归函数

# -*- conding:utf-8 -*-
def fibSeq(n):
    if n == 0:
        return  0
    elif n == 1:
        return  1
    else: return fibSeq(n-1)+fibSeq(n-2)
def main():
    n = int(input("请输入一个正整数： "))
    print("%d 的斐波那契数列为： " % (n))
    for i in range( n+1):
        x = fibSeq(i)
        print(x,end=' ')
main()