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 A076673 #6 May 29 2015 15:33:23
%S A076673 7,24,32,60,63,84,112,180,189,252,275,660,693,924,1232,1326,1768,1974,
%T A076673 2632,4026,5368,6405,8200,8319,11092,11715,15620,16401,19720,20706,
%U A076673 20880,20910,24752,24960,25300,26565,29716,29835,33048,35055,41496
%N A076673 Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=7.
%C A076673 The sequence is infinite.
%t A076673 nxt[n_]:= Module[{k = n + 1}, While[!IntegerQ[Sqrt[n^2 + k^2]], k++]; k]; NestList[nxt,7,40] (* _Harvey P. Dale_, May 29 2015 *)
%Y A076673 Cf. A076600.
%K A076673 nonn
%O A076673 1,1
%A A076673 _Zak Seidov_, Oct 25 2002