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.

Showing 1-2 of 2 results.

A120062 Number of triangles with integer sides a <= b <= c having integer inradius n.

Original entry on oeis.org

1, 5, 13, 18, 15, 45, 24, 45, 51, 52, 26, 139, 31, 80, 110, 89, 33, 184, 34, 145, 185, 103, 42, 312, 65, 96, 140, 225, 36, 379, 46, 169, 211, 116, 173, 498, 38, 123, 210, 328, 44, 560, 60, 280, 382, 134, 64, 592, 116, 228, 230, 271, 47, 452, 229, 510, 276, 134, 54
Offset: 1

Views

Author

Hugo Pfoertner, Jun 11 2006

Keywords

Comments

It is conjectured that the longest possible side c of a triangle with integer sides and inradius n is given by A057721(n) = n^4 + 3*n^2 + 1.
For n >= 1, a(n) >= 1 because triangle (a, b, c) = (n^2 + 2, n^4 + 2*n^2 + 1, n^4 + 3*n^2 + 1) has inradius n. - David W. Wilson, Jun 17 2006
Previous name was "Number of triangles with integer sides a<=bA362669); so, now effectively, a(10) = 52. - Bernard Schott, Apr 24 2023

Examples

			a(1)=1: {3,4,5} is the only triangle with integer sides and inradius 1.
a(2)=5: {5,12,13}, {6,8,10}, {6,25,29}, {7,15,20}, {9,10,17} are the only triangles with integer sides and inradius 2.
a(4)=A120252(1)+A120252(2)+A120252(4)=1+4+13 because 1, 2 and 4 are the factors of 4. The 1 primitive triangle with inradius n=1 is (3,4,5). The 4 primitive triangles with n=2 are (5,12,13), (9,10,17), (7,15,20), (6,25,29). The 13 primitive triangles with n=4 are (13,14,15), (15,15,24), (11,25,30), (15,26,37), (10,35,39), (9,40,41), (33,34,65), (25,51,74), (9,75,78), (11,90,97), (21,85,104), (19,153,170), (18,289,305). (Primitive means GCD(a, b, c, n)=1.)
		

Crossrefs

Cf. A078644 [Pythagorean triangles with inradius n], A057721 [n^4+3*n^2+1].
Let S(n) be the set of triangles with integer sides a<=b<=c and inradius n. Then:
A120062(n) gives number of triangles in S(n).
A120261(n) gives number of triangles in S(n) with gcd(a, b, c) = 1.
A120252(n) gives number of triangles in S(n) with gcd(a, b, c, n) = 1.
A005408(n) = 2n+1 gives shortest short side a of triangles in S(n).
A120064(n) gives shortest middle side b of triangles in S(n).
A120063(n) gives shortest long side c of triangles in S(n).
A120570(n) gives shortest perimeter of triangles in S(n).
A120572(n) gives smallest area of triangles in S(n).
A058331(n) = 2n^2+1 gives longest short side a of triangles in S(n).
A082044(n) = n^4+2n^2+1 gives longest middle side b of triangles in S(n).
A057721(n) = n^4+3n^2+1 gives longest long side c of triangles in S(n).
A120571(n) = 2n^4+6n^2+4 gives longest perimeter of triangles in S(n).
A120573(n) = gives largest area of triangles in S(n).
Cf. A120252 [primitive triangles with integer inradius], A120063 [minimum of longest sides], A057721 [maximum of longest sides], A120064 [minimum of middle sides], A082044 [maximum of middle sides], A005408 [minimum of shortest sides], A058331 [maximum of shortest sides], A007237 [number of triangles with integer sides and area = n times perimeter].

Programs

  • Mathematica
    (* See link above. *)

Formula

The even-numbered terms are given by a(2*n)=A007237(n).
a(n) = Sum_{k|n} A120252(k).

Extensions

More terms from Graeme McRae and Hugo Pfoertner, Jun 12 2006
Name corrected by Bernard Schott, Apr 24 2023

A362670 Integer inradii for which there exists an isosceles triangle with integer sides (a, a, c) where a < c.

Original entry on oeis.org

3, 4, 6, 8, 9, 12, 15, 16, 18, 20, 21, 24, 27, 28, 30, 32, 33, 35, 36, 39, 40, 42, 44, 45, 48, 51, 52, 54, 56, 57, 60, 63, 64, 66, 68, 69, 70, 72, 75, 76, 78, 80, 81, 84, 87, 88, 90, 92, 93, 96, 99, 100, 102, 104, 105, 108, 111, 112, 114, 116, 117, 120, 123, 124, 126, 128, 129, 132, 135
Offset: 1

Views

Author

Bernard Schott, May 05 2023

Keywords

Comments

The inradius for isosceles triangle (a, a, c) is r = (c/2)*sqrt((2*a-c)/(2*a+c)).
If m is a term, so is k*m with k > 1.
As r = 3 and r = 4 are terms, A008585 and A008586 are respective subsequences; the only terms < 100 that are not multiples of 3 or 4 are 35 and 70, the next one is r = 154 = 2*7*11 for triple (765, 765, 1386).
By the triangle inequality, a+1 <= c <= 2*a-1.
Differs from A059267. Examples: 154 is not in A059267 but in this sequence at radius r=154 with side lengths c=1386 and a=765. 442 is not in A059267 but in this sequences with r=442, c=6630, a=3435. - R. J. Mathar, Jun 26 2023

Examples

			The smallest inradius r = 3 corresponds to isosceles triangle (10, 10, 12).
The second inradius r = 4 corresponds to isosceles triangle (15, 15, 24).
r = 15 is the first inradius for which there exist two such isosceles triangles: (50, 50, 60) and (68, 68, 120).
r = 35 is the smallest inradius that is not multiple of 3 or of 4, this inradius corresponds to isosceles triangle (222, 222, 420).
		

Crossrefs

Cf. A362669 (similar but with (a,b,b)).
Showing 1-2 of 2 results.