login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A338393 Smallest perimeter of integer-sided triangles for which there exist exactly n triangles that have an integer inradius. 0

%I #27 Oct 29 2020 17:19:41

%S 12,36,60,162,108,180,228,84,132,168,210,640,252,448,504,612,462,480,

%T 396,1050,1008,630,672,1632,756,792,1380,420,1740,1232,1584,1560,1188,

%U 1540,2052,1428,1820,840,1620,1320,1890,3612,2912,2280,1092,924,2340,2730,3220

%N Smallest perimeter of integer-sided triangles for which there exist exactly n triangles that have an integer inradius.

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Incircle.html">Incircle</a>.

%e a(1) = 12 because (3,4,5) is the smallest integer-sided triangle with an integer inradius and this integer radius = 1.

%e a(2) = 36 and the 2 corresponding triangles are (9,10,17) with r=2 and (9,12,15) with r=3.

%e a(3) = 60 and the 3 corresponding triangles are (6,25,29) with r=2, (10,24,26) with r=4 and (15,20,25) with r=5.

%Y Cf. A005044, A070201, A120062.

%K nonn

%O 1,1

%A _Bernard Schott_, Oct 28 2020

%E More terms from _Amiram Eldar_, Oct 28 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)