OFFSET
1,1
COMMENTS
The triples are displayed in increasing order of perimeter (equivalently in increasing order of middle side) and if perimeters coincide then by increasing order of the smallest side; also, each triple (a, b, c) is in increasing order.
When b is prime, all the corresponding triples in A336750 are primitive triples.
The only right integer triangle in the data corresponds to the triple (3, 4, 5).
The number of primitive such triangles whose middle side = b is equal to A023022(b) for b >= 3.
For all the triples (primitive or not), miscellaneous properties and references, see A336750.
LINKS
Neal Gersh Tolunsky, Table of n, a(n) for n = 1..10000
EXAMPLE
The table begins:
2, 3, 4;
3, 4, 5;
3, 5, 7;
4, 5, 6;
5, 6, 7;
4, 7, 10;
5, 7, 9;
6, 7, 8;
The smallest such primitive triple is (2, 3, 4).
The only triangle with perimeter = 12 corresponds to the Pythagorean triple: (3, 4, 5).
There exist two triangles with perimeter = 15 corresponding to triples (3, 5, 7) and (4, 5, 6).
There exists only one primitive triangle with perimeter = 18 whose triple is (5, 6, 7), because (4, 6, 8) is not a primitive triple.
MAPLE
for b from 3 to 20 do
for a from b-floor((b-1)/2) to b-1 do
c := 2*b - a;
if gcd(a, b)=1 and gcd(b, c)=1 then print(a, b, c); end if;
end do;
end do;
MATHEMATICA
Select[Flatten[Table[{a, b, 2*b-a}, {b, 3, 20}, {a, b-Floor[(b-1)/2], b-1}], 1], GCD @@ # == 1 &] (* Paolo Xausa, Feb 28 2024 *)
PROG
(PARI) tabf(nn) = {for (b = 3, nn, for (a = b-floor((b-1)/2), b-1, my(c = 2*b - a); if (gcd([a, b, c]) == 1, print(a, " ", b, " ", c); ); ); ); } \\ Michel Marcus, Sep 08 2020
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Bernard Schott, Sep 07 2020
STATUS
approved