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-3 of 3 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

A057721 a(n) = n^4 + 3*n^2 + 1.

Original entry on oeis.org

1, 5, 29, 109, 305, 701, 1405, 2549, 4289, 6805, 10301, 15005, 21169, 29069, 39005, 51301, 66305, 84389, 105949, 131405, 161201, 195805, 235709, 281429, 333505, 392501, 459005, 533629, 617009, 709805, 812701, 926405, 1051649
Offset: 0

Views

Author

N. J. A. Sloane, Oct 27 2000

Keywords

Comments

Longest possible side c of a triangle with integer sides a <= b < c and inradius n. Triangle has sides (n^2+2, n^4+2n^2+1, n^4+3n^2+1). Proved by Joseph Myers, Jun 11 2006.

Crossrefs

See A120062 for sequences related to integer-sided triangles with integer inradius n.
Cf. A120062 [triangles with integer inradius], A120063 [minimum of their longest sides].

Programs

Formula

a(n) = denominator of Integral_{x=0..infinity} sin(n*x)/exp((n^2+1)*x). - Francesco Daddi, Jul 07 2013

A120064 Shortest side b of all integer-sided triangles with sides a<=b<=c and inradius n.

Original entry on oeis.org

4, 8, 10, 14, 20, 20, 28, 28, 30, 39, 44, 40, 52, 56, 50, 56, 68, 60, 76, 70, 70, 87, 92, 80, 100, 100, 90, 97, 116, 100, 124, 112, 110, 136, 120, 120, 148, 152, 130, 140, 164, 140, 172, 154, 150, 184, 188, 160, 196, 174, 170, 182, 212, 180, 196, 189, 190, 232, 236
Offset: 1

Views

Author

Hugo Pfoertner, Jun 13 2006

Keywords

Comments

Terms a(11),..., a(100) computed by Thomas Mautsch (mautsch(AT)ethz.ch).

Examples

			a(1)=2 because the only triangle with integer sides a<=b<c and inradius 1 is {3,4,5}; its middle side is 4.
a(2)=8: The triangles with inradius 2 are {5,12,13}, {6,8,10}, {6,25,29}, {7,15,20}, {9,10,17}. The minimum of their middle sides is min(12,8,25,15,10)=8.
		

References

  • Mohammad K. Azarian, Circumradius and Inradius, Problem S125, Math Horizons, Vol. 15, Issue 4, April 2008, p. 32. Solution published in Vol. 16, Issue 2, November 2008, p. 32.

Crossrefs

Cf. A120062 [triangles with integer inradius], A120252 [primitive triangles with integer inradius], A057721 [maximum of longest sides], A120063 [minimum of longest sides], A058331 [maximum of shortest sides], A082044 [maximum of middle sides], A005408 [minimum of shortest sides], A007237.
See A120062 for sequences related to integer-sided triangles with integer inradius n.
Showing 1-3 of 3 results.