def feb(n):
if n== 1 or n == 0:
return n
return feb(n-1) + feb(n-2)
for i in range(2, 22):
if (i-1) % 5 == 0:
print(feb(i))
continueprint(feb(i), end =' ')
Python中递归实现斐波那契数列的基本代码如下: ```python def fibonacci(n): if n print("输入错误,n应大于0") elif n == 1 or n == 2: return 1 else: return fibonacci(n-1) + fibonacci(n-2) ``` 这个...