login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

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

%I #14 Jun 04 2024 02:16:17

%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

%p Fibs:= {seq(combinat:-fibonacci(i),i=0..100)}:

%p sort(convert(select(issqr,{seq(seq(Fibs[i]+Fibs[j],j=1..i),i=1..100)}),list)); # _Robert Israel_, Jun 03 2024

%t Select[Union[Total/@Subsets[Fibonacci[Range[0,100]],{2}],Table[Fibonacci[n]*2,{n,0,100}]],IntegerQ[Sqrt[#]]&] (* _James C. McMahon_, Jun 03 2024 *)

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 16 01:40 EDT 2024. Contains 374343 sequences. (Running on oeis4.)