|
| |
|
|
A070080
|
|
Smallest side of integer triangles [a(n)<=A070081(n)<=A070082(n)], sorted by perimeter, lexicographically ordered.
|
|
87
|
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,3
|
|
|
COMMENTS
|
a(n) + A070081(n) + A070082(n) = A070083(n).
|
|
|
LINKS
|
Table of n, a(n) for n=1..90.
R. Zumkeller, Integer-sided triangles
|
|
|
MATHEMATICA
|
maxPer = 22; maxSide = Floor[(maxPer-1)/2]; order[{a_, b_, c_}] := (a+b+c)*maxPer^3 + a*maxPer^2 + b*maxPer + c; triangles = Reap[Do[If[ a+b+c <= maxPer && c-b < a < c+b && b-a < c < b+a && c-a < b < c+a, Sow[{a, b, c}]], {a, 1, maxSide}, {b, a, maxSide}, {c, b, maxSide}]][[2, 1]]; Sort[triangles, order[#1] < order[#2] &] [[All, 1]](* Jean-François Alcover, Jun 12 2012 *)
|
|
|
CROSSREFS
|
Cf. A070084, A070085, A070086, A055594, A069597, A046128.
Sequence in context: A007723 A067437 A029315 * A131400 A132749 A140186
Adjacent sequences: A070077 A070078 A070079 * A070081 A070082 A070083
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Reinhard Zumkeller, May 05 2002
|
|
|
STATUS
|
approved
|
| |
|
|
