login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111378 Squares that are equal to the sum of two Fibonacci numbers. 1

%I

%S 0,1,4,9,16,36,144,1600,14930496

%N Squares that are equal to the sum of two Fibonacci numbers.

%C Any further terms have more than 10,000 digits. - _Charles R Greathouse IV_, Sep 16 2015

%o (PARI) list(lim)=my(F=List(),v=List([0,1]),n=1,t); while((t=fibonacci(n++))<=lim, listput(F,t)); F=Vec(F); for(i=1,#F,for(j=i,#F, if(issquare(t=F[i]+F[j]), listput(v,t)))); Set(v) \\ _Charles R Greathouse IV_, Sep 16 2015

%Y Squares in A084176 (or A059389). Cf. A000045.

%K nonn

%O 1,3

%A _Giovanni Teofilatto_, Nov 09 2005

%E 1600 from _Jonathan Vos Post_, Nov 11 2005

%E 14930496 from _N. J. A. Sloane_, Nov 11 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 10:21 EDT 2021. Contains 343087 sequences. (Running on oeis4.)