A096467 -id:A096467 - cp's OEIS frontend

A096468 Perimeters of primitive Heronian triangles.

12, 16, 18, 30, 32, 36, 40, 42, 44, 48, 50, 54, 56, 60, 64, 66, 68, 70, 72, 76, 78, 80, 84, 90, 96, 98, 100, 104, 108, 110, 112, 114, 120, 126, 128, 130, 132, 136, 140, 144, 150, 152, 154, 156, 160, 162, 164, 168, 170, 172, 174, 176, 180, 182, 186, 190, 192, 196

Offset: 1

T. D. Noe, Jun 22 2004

nonn

Here a primitive Heronian triangle has integer sides a,b,c with GCD(a,b,c) = 1 and integral area. The perimeter is always even. Cheney's article contains many theorems about these triangles.

			12 is on this list because the triangle with sides 3, 4, 5 has integral area and perimeter 12.

Peter Kagey and Giovanni Resta, Table of n, a(n) for n = 1..10000 (first 1000 terms from Peter Kagey)
Wm. Fitch Cheney, Jr., Heronian Triangles, Amer. Math. Monthly, Vol. 36, No. 1 (Jan 1929), 22-28.
Eric Weisstein's World of Mathematics, Heronian Triangle

Cf. A070138 (number of primitive Heronian triangles having perimeter n), A083875 (area/6 of primitive Heronian triangles), A096467 (longest side of primitive Heronian triangles).

nn=150; lst={}; Do[s=(a+b+c)/2; If[IntegerQ[s] && GCD[a, b, c]==1, area2=s(s-a)(s-b)(s-c); If[area2>0 && IntegerQ[Sqrt[area2]], AppendTo[lst, 2s]]], {a, nn}, {b, a}, {c, b}]; Union[lst]

Name changed by Wesley Ivan Hurt, May 17 2020

A239246 Number of primitive Heronian triangles with n as greatest side length.

Original entry on oeis.org

0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 2, 0, 2, 0, 3, 0, 0, 2, 2, 0, 0, 1, 3, 2, 0, 1, 2, 3, 0, 0, 0, 0, 2, 1, 5, 0, 4, 3, 4, 1, 0, 2, 1, 0, 0, 2, 0, 2, 4, 6, 4, 0, 2, 2, 0, 2, 0, 1, 3, 0, 1, 0, 8, 2, 0, 5, 1, 2, 0, 0, 6, 2, 7, 0, 3, 0, 0, 3, 0, 2, 0, 0, 9

Offset: 1

Frank M Jackson, Mar 13 2014

nonn

			a(17)=3 as there are 3 primitive Heronian triangles with greatest side length of 17. They are (9, 10, 17), (8, 15, 17) and (16, 17, 17).

Giovanni Resta, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Heronian Triangle.

Cf. A054875, A070138, A096467, A123323, A134587.

nn=200; lst={}; Do[s=(a+b+c)/2; If[IntegerQ[s]&&GCD[a, b, c]==1, area2=s(s-a)(s-b)(s-c); If[area2>0&&IntegerQ[Sqrt[area2]], AppendTo[lst, c]]], {c, 3, nn}, {b, c}, {a, b}]; Table[Length@Select[lst, #==n &], {n, 1, nn}] (* using T. D. Noe's program at A083875 *)

A306626 Numbers that set a record for occurrences as longest side of a primitive Heronian triangle.

Original entry on oeis.org

1, 5, 13, 17, 37, 52, 65, 85, 119, 125, 145, 221, 325, 481, 697, 725, 1025, 1105, 1625, 1885, 2465, 2665, 3145, 5525, 6409, 15457, 15725, 26129, 27625, 38425, 40885, 45305, 58565, 67405, 69745, 83317, 128945, 160225, 204425, 226525, 237133, 292825, 348725

Offset: 1

Amiram Eldar and Peter Munn, Mar 01 2019

nonn

Congruent triangles are identified, that is to say mirror images are not distinguished.
The corresponding numbers of occurrences are 0, 1, 2, 3, 5, 6, 8, ...
A239246(k) gives the number of occurrences for any integer k.
The qualifier "primitive" means that we count only triangles whose sides have a gcd of 1. The equivalent sequence without this qualification is A322105.
The terms that are common with A322105 are 1, 5, 13, 52, 65, 145, 325, 1105, 5525, ...
The odd prime factors of the terms are almost all congruent to 1 modulo 4. a(9) = 119 = 7 * 17 provides the only exception in the first 50 terms. [updated by Peter Munn, Dec 04 2019]

			13 is in the sequence since it occurs in a record number of 2 triangles of side lengths {5, 12, 13} and {10, 13, 13}.
The side lengths, a(n), and their corresponding record numbers of occurrences, A239246(a(n)), are:
n       a(n)     prime factorization of a(n)  occurrences
1          1     -                               0
2          5     5                               1
3         13     13                              2
4         17     17                              3
5         37     37                              5
6         52     2^2 * 13                        6
7         65     5 * 13                          8
8         85     5 * 17                          9
9        119     7 * 17                         10
10       125     5^3                            13
11       145     5 * 29                         20
12       221     13 * 17                        30
13       325     5^2 * 13                       37
14       481     13 * 37                        42
15       697     17 * 41                        50
16       725     5^2 * 29                       54
17      1025     5^2 * 41                       63
18      1105     5 * 13 * 17                    90
19      1625     5^3 * 13                       93
20      1885     5 * 13 * 29                   106
21      2465     5 * 17 * 29                   116
22      2665     5 * 13 * 41                   134
23      3145     5 * 17 * 37                   178
24      5525     5^2 * 13 * 17                 277
25      6409     13 * 17 * 29                  373
26     15457     13 * 29 * 41                  396
27     15725     5^2 * 17 * 37                 463

Ray Chandler, Table of n, a(n) for n = 1..67 (terms < 6*10^6; first 50 terms from Giovanni Resta)

Cf. A096467, A120130, A239246, A322105.

okQ[x_, y_, z_] := GCD[x, y, z]==1 && If[x + y <= z, False, Module[{s = (x + y + z)/2}, IntegerQ[ Sqrt[s(s-x)(s-y)(s-z)]]] ]; a[n_] := Module[{num = 0}, Do[Do[If[okQ[x, y, n], num++], {x, 1, y}], {y, 1, n}]; num]; amax=-1; s={}; Do[a1=a[n]; If[a1 > amax, AppendTo[s, n]; amax=a1], {n, 1, 100}]; s

a(28)-a(43) from Giovanni Resta, Nov 07 2019

A322105 Numbers that set a record for occurrences as longest side of a triangle with integer sides and positive integer area.

Original entry on oeis.org

1, 5, 13, 15, 25, 30, 52, 65, 75, 100, 120, 145, 195, 300, 325, 390, 520, 585, 600, 650, 780, 975, 1105, 1300, 1560, 1700, 1950, 2550, 2600, 3315, 3900, 4420, 5100, 5525, 6630, 7800, 8840, 10200, 11050, 13260, 16575, 22100, 26520, 33150, 44200, 53040, 66300, 96135

Offset: 1

Amiram Eldar and Peter Munn, Nov 26 2018

nonn

Congruent triangles are identified, that is to say mirror images are not distinguished.
The corresponding numbers of occurrences are 0, 1, 2, 3, 4, 7, 10, ...
A054875(k) gives the number of occurrences for any integer k.

			13 is in the sequence since it occurs in a record number of 2 triangles of side lengths {5, 12, 13} and {10, 13, 13}.
The side lengths, a(n), and their corresponding record numbers of occurrences, A054875(a(n)), are:
n       a(n)     prime factorization of a(n)  occurrences
1          1     -                               0
2          5     5                               1
3         13     13                              2
4         15     3 * 5                           3
5         25     5^2                             4
6         30     2 * 3 * 5                       7
7         52     2^2 * 13                       10
8         65     5 * 13                         11
9         75     3 * 5^2                        13
10       100     2^2 * 5^2                      15
11       120     2^3 * 3 * 5                    22
12       145     5 * 29                         23
13       195     3 * 5 * 13                     35
14       300     2^2 * 3 * 5^2                  41
15       325     5^2 * 13                       51
16       390     2 * 3 * 5 * 13                 57
17       520     2^3 * 5 * 13                   63
18       585     3^2 * 5 * 13                   64
19       600     2^3 * 3 * 5^2                  72
20       650     2 * 5^2 * 13                   82
21       780     2^2 * 3 * 5 * 13               94
22       975     3 * 5^2 * 13                  135
23      1105     5 * 13 * 17                   143
24      1300     2^2 * 5^2 * 13                158
25      1560     2^3 * 3 * 5 * 13              171
26      1700     2^2 * 5^2 * 17                182
27      1950     2 * 3 * 5^2 * 13              210
28      2550     2 * 3 * 5^2 * 17              216
29      2600     2^3 * 5^2 * 13                251
30      3315     3 * 5 * 13 * 17               333
31      3900     2^2 * 3 * 5^2 * 13            367
32      4420     2^2 * 5 * 13 * 17             373
33      5100     2^2 * 3 * 5^2 * 17            406
34      5525     5^2 * 13 * 17                 496
35      6630     2 * 3 * 5 * 13 * 17           525
36      7800     2^3 * 3 * 5^2 * 13            605
37      8840     2^3 * 5 * 13 * 17             610
38     10200     2^3 * 3 * 5^2 * 17            660
39     11050     2 * 5^2 * 13 * 17             735
40     13260     2^2 * 3 * 5 * 13 * 17         897
41     16575     3 * 5^2 * 13 * 17            1132
42     22100     2^2 * 5^2 * 13 * 17          1276

Ray Chandler, Table of n, a(n) for n = 1..79 (terms < 6*10^6; first 67 terms from Giovanni Resta)
Ray Chandler, First 79 terms with corresponding occurrences (first 67 terms from Giovanni Resta)

Cf. A054875, A096467, A120130, A306626.

okQ[x_, y_, z_] := If[x + y <= z, False, Module[{s = (x + y + z)/2}, IntegerQ[ Sqrt[s(s-x)(s-y)(s-z)]]] ]; a[n_] := Module[{num = 0}, Do[Do[If[okQ[x, y, n], num++], {x, 1, y}], {y, 1, n}]; num]; amax=-1; s={}; Do[a1=a[n]; If[a1 > amax, AppendTo[s, n]; amax=a1],{n,1,100}]; s

a(43)-a(48) from Giovanni Resta, Nov 03 2019

cp's OEIS Frontend

A096468 Perimeters of primitive Heronian triangles.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A239246 Number of primitive Heronian triangles with n as greatest side length.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

A306626 Numbers that set a record for occurrences as longest side of a primitive Heronian triangle.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A322105 Numbers that set a record for occurrences as longest side of a triangle with integer sides and positive integer area.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions