PY
py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
n = 7
def fibs(n, x = 0, y = 1, nums = []):
# append
if len(nums) < n:
#print(y)
nums.append(y)
x, y = y, y + x
# return
else:
return nums
# recursion
return fibs(n, x, y, nums)
print(fibs(n))
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run