def fibonacci_recursion(my_val):
    if my_val <= 1:
        return my_val
    else:
        return (fibonacci_recursion(my_val-1) + fibonacci_recursion(my_val-2))

num_terms = 12

if num_terms <= 0:
    print("输入一个正整数")
else:
    print("Fibonacci序列是：")
    for i in range(num_terms):
       print(fibonacci_recursion(i))

Fibonacci序列是：
0
1
1
2
3
5
8
13
21
34
55
89