fibo.rar_fibo_fibo数列的函数_裴波那挈数列递归算法

def Fibo(n): if n<=1: Fibo(n)= n return (Fibo(n-1)+Fibo(n-2)) n=0 sum=0 if Fibo(n)<=4000000: n=n+1 else temp=n for i in range(0,temp): if Fibo(i)%2==0: sum=sum+Fibo(i) print sum