Fibonacci sequence recursive function

# -*- 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( " Please enter a positive integer: " ))
     print ( " The Fibonacci number column of %d is: " % (n))
     for i in range( n+1 ):
        x = fibSeq(i)
        print(x,end=' ')
main()