PY
py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
def fib_recursive(n):
if n == 0:
return []
elif n == 1:
return [0]
elif n == 2:
return [0, 1]
else:
seq = fib_recursive(n - 1)
return seq + [seq[-1] + seq[-2]]
def fib(n):
seq = fib_recursive(n)
for num in seq:
print(num)
num = int(input())
fib(num)
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run