|
%I #17 Feb 19 2019 18:18:41
%S 120,168,300,360,1920,2016,2688,4680,4800,5760,9720,10140,13608,14280,
%T 18720,19080,23256,24300,29160,30720,32760,34440,34680,38640,42120,
%U 43008,57720,74880,75000,76800,92160,94080,105000,128700,162240,177072,187500,217728
%N Integer areas of integer-sided triangles where two sides are of square length.
%C Subset of A188158.
%C The areas of the triangles (a,b,c) are given by Heron's formula, A = sqrt(s(s-a)(s-b)(s-c)), where its side lengths are a, b, c and semiperimeter s = (a+b+c)/2.
%C The areas A of the primitive triangles of sides (a,b,c) are 120, 168, 300, 360, 4680, ...
%C The areas of the nonprimitive triangle of sides (a*p^2, b*p^2, c*p^2) are in the sequence with the value A*p^4.
%C It is possible to find integer-sided triangles having two square sides, for example:
%C a(2) = 168 with sides (25,25,48) and (14,25,25);
%C a(3) = 300 with sides (25,25,30) and (25,25,40);
%C a(14) = 14280 with sides (169,169,238), (169,169,240), (100,289,291).
%C The following table gives the first values (A, a, b, c):
%C +-------+-----+-----+-----+
%C | A | a | b | c |
%C +-------+-----+-----+-----+
%C | 120 | 16 | 25 | 39 |
%C | 168 | 14 | 25 | 25 |
%C | 300 | 25 | 25 | 40 |
%C | 360 | 25 | 29 | 36 |
%C | 1920 | 64 | 100 | 156 |
%C | 2016 | 64 | 225 | 287 |
%C | 2688 | 100 | 100 | 192 |
%C | 4680 | 74 | 169 | 225 |
%C | 4800 | 100 | 100 | 160 |
%C | 5760 | 100 | 116 | 144 |
%C | 9720 | 144 | 225 | 351 |
%C | 10140 | 169 | 169 | 312 |
%C | 13608 | 225 | 225 | 432 |
%C +-------+-----+-----+-----+
%H J. Peng, Y. Zhang, <a href="https://doi.org/10.1007/s10474-018-00907-0">Heron triangles with figurate number sides</a>, Acta Mathematica Hungarica (2019) 1-11.
%e 120 is in the sequence because the triangle (4^2, 5^2, 39) has semiperimeter s = (16+25+39)/2 = 40, and A = sqrt(40*(40-16)*(40-25)*(40-39)) = 120.
%t nn=1000;lst={};Do[s=(a+b+c)/2;If[IntegerQ[s],area2=s (s-a) (s-b) (s-c);If[0<area2&&((IntegerQ[Sqrt[a]]&&IntegerQ[Sqrt[b]])||(IntegerQ[Sqrt[a]]&&IntegerQ[Sqrt[c]])||(IntegerQ[Sqrt[b]]&&IntegerQ[Sqrt[c]]))&&IntegerQ[Sqrt[area2]],AppendTo[lst,Sqrt[area2]]]],{a,nn},{b,a},{c,b}];Union[lst]
%t sqr[n_]:=n^2; area[a_, b_, c_] := Module[{s = (a + b + c)/2, a2}, a2 = s (s - a) (s - b) (s - c); If[a2 < 0, 0, Sqrt[a2]]]; goodQ[a_, b_, c_] := Module[{ar = area[a, b, c]}, ar > 0 && IntegerQ[ar]]; nn = 80; t = {}; ps = sqr[Range[2, nn]]; mx = 3*ps[[-1]]; Do[If[p <= q && goodQ[p, q, e], aa = area[p, q, e]; If[aa <= mx, AppendTo[t, aa]]], {p, ps}, {q, ps}, {e, q - p + 2, p + q - 2, 2}]; t = Union[t] (* program from _T. D. Noe_ adapted for this sequence - see A229746 *)
%Y Cf. A000290, A188158.
%K nonn
%O 1,1
%A _Michel Lagneau_, Nov 24 2013
|
