This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A045702 #16 May 19 2019 11:34:11
%S A045702 0,1,2,4,5,8,9,10,13,18,25,26,29,34,50,64,65,68,73,89,128,169,170,173,
%T A045702 178,194,233,338,441,442,445,450,466,505,610,882,1156,1157,1160,1165,
%U A045702 1181,1220,1325,1597,2312,3025,3026,3029,3034,3050,3089,3194,3466
%N A045702 Sums of two squares of Fibonacci numbers.
%H A045702 T. D. Noe, <a href="/A045702/b045702.txt">Table of n, a(n) for n = 1..1000</a>
%H A045702 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%F A045702 a(4)=5 because 5 = 1^2 + 2^2;
%F A045702 a(8)=13 because 13 = 2^2 + 3^2.
%t A045702 Take[Union[Total/@Tuples[Fibonacci[Range[0,15]]^2,{2}]],60] (* _Harvey P. Dale_, Jan 17 2011 *)
%o A045702 (PARI) list(lim)=my(sq=sqrtint(lim\=1),v=List(),f=List([0,1]),t); while((t=f[#f]+f[#f-1])<=sq, listput(f,t)); f=apply(sqr,f); for(i=1,#f, for(j=1,i, t=f[i]+f[j]; if(t>lim, break); listput(v,t))); Set(v) \\ _Charles R Greathouse IV_, Jun 27 2017
%K A045702 nonn,easy,nice
%O A045702 1,3
%A A045702 _Felice Russo_