Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Jan 22 2020 10:52:39
%S 60,84,105,120,132,140,156,165,168,180,195,204,220,228,231,240,252,
%T 255,260,264,273,276,280,285,300,308,312,315,336,340,345,348,357,360,
%U 364,372,380,385,396,399,408,420,429,435,440,444,455,456,460,465,468,476
%N Short legs of more than two primitive Pythagorean triangles.
%H Ray Chandler, <a href="/A138604/b138604.txt">Table of n, a(n) for n = 1..10000</a>
%e 60, 91,109; 60,221,229; 60, 899, 901;
%e 84,187,205; 84, 437, 445; 84,1763,1765;
%e 105,208,233; 105, 608, 617; 105,5512,5513;
%e 120,209,241; 120, 391, 409; 120,3599,3601;
%e 132,475,493; 132,1085,1093; 132,4355,4357;
%e 140,171,221; 140,1221,1229; 140,4899,4901;
%e 156,667,685; 156,1517,1525; 156,6083,6085;
%t lst = {}; aa = aaa = 1;For[a=1,a<=500,For[b=a+1,((b+1)^2-b^2)<=a^2,c=(a^2+b^2)^0.5;If[c==Round[c]&&GCD[a,b]==1,If[a == aaa, Print[a]; AppendTo[lst, a]];aaa=aa;aa=a;];b++ ];a++ ];Union[lst]
%K nonn
%O 1,1
%A _Vladimir Joseph Stephan Orlovsky_, May 13 2008
%E More terms _Vladimir Joseph Stephan Orlovsky_, Jan 24 2009
%E More terms from _Ray Chandler_, Jan 22 2020