2.py 257 B

123456789101112131415161718
  1. def fib(n):
  2. if n == 0:
  3. return 0
  4. if n == 1:
  5. return 1
  6. else:
  7. return fib(n-1) + fib(n-2)
  8. fiblist = []
  9. for i in range(1,34):
  10. fiblist.append(fib(i))
  11. summation = 0
  12. for i in range(33):
  13. if fiblist[i] % 2 == 0:
  14. summation += fiblist[i]
  15. print(summation)