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 A164282 #13 Aug 18 2018 17:40:47
%S A164282 65,85,125,130,145,170,185,195,205,221,250,255,260,265,290,305,325,
%T A164282 340,365,370,375,377,390,410,425,435,442,445,455,481,485,493,500,505,
%U A164282 510,520,530,533,545,555,565,580,585,595,610,615,625,629,650,663,680,685,689
%N A164282 Hypotenuses of more than two Pythagorean triangles.
%C A164282 Also, hypotenuses c of Pythagorean triangles with legs a and b such that a and b are also the hypotenuses of Pythagorean triangles, where the Pythagorean triples (x1,y1,a) and (x2,y2,b) are similar triangles, but the Pythagorean triples (a,b,c) and (x1,y1,a) are not similar. For example, 65^2 = 25^2 + 60^2 with 25^2 = 15^2 + 20^2 and 60^2 = 36^2 + 48^2 with the two smaller triangles being similar. - _Naohiro Nomoto_
%H A164282 Andrew Howroyd, <a href="/A164282/b164282.txt">Table of n, a(n) for n = 1..1000</a>
%e A164282 65 is included because there are 4 distinct Pythagorean triangles with hypotenuse 65. In particular, 65^2 = 16^2 + 63^2 = 25^2 + 60^2 = 33^2 + 56^2 = 39^2 + 52^2.
%t A164282 Clear[lst,f,n,i,k] f[n_]:=Module[{i=0,k=0},Do[If[Sqrt[n^2-i^2]==IntegerPart[Sqrt[n^2-i^2]],k++ ],{i,n-1,1,-1}];k/2]; lst={};Do[If[f[n]>2,AppendTo[lst,n]],{n,5*5!}];lst
%o A164282 (PARI) ok(n)={my(t=0); for(k=1, sqrtint(n^2\2), t += issquare(n^2-k^2)); t>2}
%o A164282 select(ok, [1..1000]) \\ _Andrew Howroyd_, Aug 17 2018
%Y A164282 Cf. A009177, A084646, A084647, A084648, A084649.
%K A164282 nonn
%O A164282 1,1
%A A164282 _Vladimir Joseph Stephan Orlovsky_, Aug 12 2009
%E A164282 Terms a(45) and beyond from _Andrew Howroyd_, Aug 17 2018