The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A099830 Smallest perimeter S such that exactly n distinct Pythagorean triangles with this perimeter can be constructed. 3
 12, 60, 120, 240, 420, 720, 1320, 840, 2640, 1680, 3360, 2520, 4620, 7920, 7560, 5040, 10080, 17160, 10920, 9240, 40320, 25200, 28560, 21840, 18480, 60480, 41580, 46200, 36960, 32760, 27720, 78540, 60060, 129360, 134640, 115920, 85680, 65520, 83160 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Least perimeter common to exactly n distinct Pythagorean triangles. - Lekraj Beedassy, Jun 07 2006 LINKS Ray Chandler, Table of n, a(n) for n = 1..163 Ron Knott, Pythagorean Triples and Online Calculators Eric Weisstein's World of Mathematics, Pythagorean Triple. EXAMPLE a(7)=1320 because 1320 is the smallest possible perimeter for which exactly 7 different Pythgorean triangles exist: 1320 = 110+600+610 = 120+594+606 = 220+528+572 = 231+520+569 = 264+495+561 = 330+440+550 = 352+420+548. CROSSREFS Cf. A099829 first perimeter producing at least n Pythagorean triangles, A009096 ordered perimeters of Pythagorean triangles, A001399, A069905 partitions into 3 parts. Sequence in context: A094807 A120644 A099829 * A158443 A153792 A229616 Adjacent sequences:  A099827 A099828 A099829 * A099831 A099832 A099833 KEYWORD nonn,changed AUTHOR Hugo Pfoertner, Oct 27 2004 EXTENSIONS More terms from Ray Chandler, Oct 29 2004 STATUS approved

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

Last modified February 19 03:54 EST 2020. Contains 332032 sequences. (Running on oeis4.)