|
%I #13 Jul 31 2018 03:32:20
%S 1,1,4,1,-1,4,1,-3,9,4,2,1,-5,-7,9,4,0,16,1,-7,-11,9,7,4,-2,-4,16,1,
%T -9,-15,9,-17,5,25,4,-4,-8,16,14,1,-11,-19,9,-23,3,1,25,4,-6,-12,16,
%U -14,12,36,1,-13,-23,9,-29,1,-31,-3,25,23,4,-8
%N a(n) = A070080(n)^2 + A070081(n)^2 - A070082(n)^2.
%C The integer triangle [A070080(n)<=A070081(n)<=A070082(n)] is acute iff a(n)>0, right iff a(n)=0 and obtuse iff a(0)<0.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/AcuteTriangle.html">Acute Triangle</a>.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/RightTriangle.html">Right Triangle</a>.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ObtuseTriangle.html">Obtuse Triangle</a>.
%H R. Zumkeller, <a href="/A070080/a070080.txt">Integer-sided triangles</a>
%t maxPer = m = 22;
%t sides[per_] := Select[Reverse /@ IntegerPartitions[per, {3}, Range[Ceiling[ per/2]]], #[[1]] < per/2 && #[[2]] < per/2 && #[[3]] < per/2&];
%t triangles = DeleteCases[Table[sides[per], {per, 3, m}], {}] // Flatten[#, 1]& // SortBy[Total[#] m^3 + #[[1]] m^2 + #[[2]] m + #[[1]]&];
%t #[[1]]^2 + #[[2]]^2 - #[[3]]^2& /@ triangles (* _Jean-François Alcover_, Jul 31 2018 *)
%Y Cf. A070093, A070101, A024155, A070118, A070127, A070136.
%K sign
%O 1,3
%A _Reinhard Zumkeller_, May 05 2002
|
