login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A070080
Smallest side of integer triangles [a(n) <= A070081(n) <= A070082(n)], sorted by perimeter, lexicographically ordered.
90
1, 1, 2, 1, 2, 2, 1, 2, 3, 2, 3, 1, 2, 3, 3, 2, 3, 4, 1, 2, 3, 3, 4, 2, 3, 4, 4, 1, 2, 3, 3, 4, 4, 5, 2, 3, 4, 4, 5, 1, 2, 3, 3, 4, 4, 5, 5, 2, 3, 4, 4, 5, 5, 6, 1, 2, 3, 3, 4, 4, 5, 5, 5, 6, 2, 3, 4, 4, 5, 5, 6, 6, 1, 2, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 2, 3, 4, 4, 5, 5
OFFSET
1,3
LINKS
FORMULA
a(n) = A070083(n) - A070082(n) - A070081(n).
MATHEMATICA
m = 55 (* max perimeter *);
sides[per_] := Select[Reverse /@ IntegerPartitions[per, {3}, Range[ Ceiling[per/2]]], #[[1]] < per/2 && #[[2]] < per/2 && #[[3]] < per/2&];
triangles = DeleteCases[Table[sides[per], {per, 3, m}], {}] // Flatten[#, 1]& // SortBy[Total[#] m^3 + #[[1]] m^2 + #[[2]] m + #[[1]]&];
triangles[[All, 1]] (* Jean-François Alcover, Jun 12 2012, updated Jul 09 2017 *)
CROSSREFS
Cf. A316841, A316843, A316844, A316845 (sides (i,j,k) with j + k > i >= j >= k >= 1).
Cf. A331244, A331245, A331246 (similar, but triangles sorted by radius of enclosing circle), A331251, A331252, A331253 (triangles sorted by area), A331254, A331255, A331256 (triangles sorted by radius of circumcircle).
Sequence in context: A282518 A230241 A029315 * A230196 A131400 A132749
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, May 05 2002
STATUS
approved