%I A120572
%S A120572 6,24,48,84,150,192,294,336,432,540,726,756,1014,1134,1170,1344,1734,
%T A120572 1710,2166,2100,2310,2640,3174,3000,3750,4056,3888,4116,5046,4680,5766,
%U A120572 5376,5808,6936,6510,6804,8214,8664,8112,8400,10086,9240,11094,10164
%N A120572 Smallest area of any triangle with integer sides a<=b<=c and inradius 
               n.
%C A120572 a(n) == 0 (mod 6).
%C A120572 Empirically, 3*sqrt(3) < a(n)/n^2 <= 6. The lower bound is provably tight, 
               the upper bound seems to be achieved infinitely often, e.g, for prime 
               n >= 5.
%H A120572 David W. Wilson, <a href="b120572.txt">Table of n, a(n) for n = 1..10000</
               a>
%Y A120572 See A120062 for sequences related to integer-sided triangles with integer 
               inradius n.
%Y A120572 Sequence in context: A161333 A002688 A083212 this_sequence A000056 A083170 
               A087081
%Y A120572 Adjacent sequences: A120569 A120570 A120571 this_sequence A120573 A120574 
               A120575
%K A120572 nonn
%O A120572 1,1
%A A120572 David W. Wilson (davidwwilson(AT)comcast.net), Jun 17 2006