Square Fibonacci ? Sounds Crazy !

Fibonacci sequence is defined as F0=0,F1=1F_0=0 , F_1=1 and for n2n \geq 2 Fn=Fn1+Fn2F_n=F_{n-1}+F_{n-2}

So the Fibonacci sequence is 0,1,1,2,3,5,8,13,...0,1,1,2,3,5,8,13,...

Find the sum of all the terms in the Fibonacci sequence which are less than 1 billion\textbf{1 billion} and are perfect squares\textbf{perfect squares}.


Details and assumptions:-

Perfect square means square of an integer.


This problem is a part of the set Crazy Fibonacci

×

Problem Loading...

Note Loading...

Set Loading...