cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A099830 Smallest perimeter S such that exactly n distinct Pythagorean triangles with this perimeter can be constructed.

Original entry on oeis.org

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
Offset: 1

Views

Author

Hugo Pfoertner, Oct 27 2004

Keywords

Comments

Least perimeter common to exactly n distinct Pythagorean triangles. - Lekraj Beedassy, Jun 07 2006

Examples

			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.

Extensions

More terms from Ray Chandler, Oct 29 2004