A070209 -id:A070209 - cp's OEIS frontend

A070210 Inradii of integer triangles [A070080(A070209(n)), A070081(A070209(n)), A070082(A070209(n))].

1, 2, 2, 3, 2, 3, 3, 2, 4, 3, 4, 4, 3, 2, 4, 5, 3, 6, 4, 6, 6, 6, 4, 6, 3, 4, 3, 6, 4, 5, 4, 3, 6, 5, 7, 8, 6, 4, 6, 8, 7, 8, 9, 3, 9, 5, 6, 9, 8, 10, 6, 6, 6, 9, 8, 4, 8, 9, 7, 10, 6, 10, 12, 6, 12, 12, 5, 3, 7, 8, 10, 4, 9, 10, 11, 6, 12, 3, 6, 9, 12, 12, 7, 8

Offset: 1

Reinhard Zumkeller, May 05 2002

nonn

a(n) = A070200(A070209(n)).

			A070209(3)=212: [A070080(212), A070081(212), A070082(212)] = [5,12,13], let s = A070083(212)/2 = (5+12+13)/2 = 15 then inradius = sqrt((s-5)*(s-5)*(s-6)/s) = sqrt(10*3*2/15) = sqrt(4) = 2; a(3) = A070200(212) = 2.

Mohammad K. Azarian, Solution of problem 125: Circumradius and Inradius, Math Horizons, Vol. 16, No. 2 (Nov. 2008), p. 32.
Eric Weisstein's World of Mathematics, Incircle.
R. Zumkeller, Integer-sided triangles

Cf. A070149, A070201.

A070142 Numbers n such that [A070080(n), A070081(n), A070082(n)] is an integer triangle with integer area.

Original entry on oeis.org

17, 39, 52, 116, 212, 252, 269, 368, 370, 372, 375, 493, 561, 587, 659, 839, 850, 862, 957, 972, 1156, 1186, 1196, 1204, 1297, 1582, 1599, 1629, 1912, 1920, 1955, 1971, 1988, 2115, 2352, 2555, 2574, 2713, 2774, 2778, 2790

Offset: 1

Reinhard Zumkeller, May 05 2002

nonn

			a(2)=39: [A070080(39), A070081(39), A070082(39)] = [5,5,6], area^2 = s*(s-5)*(s-5)*(s-6) with s=A070083(39)/2=(5+5+6)/2=8, area^2=8*3*3*2=16*9 is an integer square, therefore A070086(39)=area=4*3=12.

Eric Weisstein's World of Mathematics, Heronian Triangle.
R. Zumkeller, Integer-sided triangles

Cf. A070088, A070149, A070143, A070144, A070145, A051516, A069594, A069597, A070136, A070137, A070209.

maxPerim = 100; maxSide = Floor[(maxPerim - 1)/2]; order[{a_, b_, c_}] := (a + b + c)*maxPerim^3 + a*maxPerim^2 + b*maxPerim + c; triangles = Reap[ Do[ If[ a + b + c <= maxPerim && 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]]; stri = Sort[ triangles, order[#1] < order[#2]&]; area[{a_, b_, c_}] := With[{p = (a + b + c)/2}, Sqrt[p*(p - a)*(p - b)*(p - c)]]; Position[ stri, tri_ /; IntegerQ[area[tri]]] // Flatten (* Jean-François Alcover, Feb 22 2013 *)

A070201 Number of integer triangles with perimeter n having integral inradius.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 2, 0, 0, 0, 1, 0, 2, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 3, 0, 0, 0, 2, 0, 1, 0, 1, 0, 2, 0, 2, 0, 0, 0, 1, 0, 1, 0, 2, 0, 0, 0, 8, 0, 0, 0, 1, 0, 3

Offset: 1

Reinhard Zumkeller, May 05 2002

nonn

a(n) = #{k | A070083(k) = n and A070200(k) = exact inradius};
a(n) = A070203(n) + A070204(n);
a(n) = A070205(n) + A070206(n) + A024155(n);
a(odd) = 0.

			a(36)=2, as there are two integer triangles with integer inradius having perimeter=32:
First: [A070080(368), A070081(368), A070082(368)] = [9,10,17], for s = A070083(368)/2 = (9+10+17)/2 = 18: inradius = sqrt((s-9)*(s-10)*(s-17)/s) = sqrt(9*8*1/18) = sqrt(4) = 2; therefore A070200(368) = 2.
2nd: [A070080(370), A070081(370), A070082(370)] = [9,12,15], for s = A070083(370)/2 = (9+12+15)/2 = 18: inradius = sqrt((s-9)*(s-12)*(s-15)/s) = sqrt(9*6*3/18) = sqrt(9) = 3; therefore A070200(370) = 3.

Seiichi Manyama, Table of n, a(n) for n = 1..5000
Mohammad K. Azarian, Solution to Problem S125: Circumradius and Inradius, Math Horizons, Vol. 16, Issue 2, November 2008, p. 32.
Eric Weisstein's World of Mathematics, Incircle.
Eric Weisstein's World of Mathematics, Heron's Formula.
Reinhard Zumkeller, Integer-sided triangles

Cf. A070209, A070202, A070208, A005044, A070140.

Cf. A120062, A120572, A331040.

def A(n)
  cnt = 0
  (1..n / 3).each{|a|
    (a..(n - a) / 2).each{|b|
      c = n - a - b
      if a + b > c
        s = n / 2r
        t = (s - a) * (s - b) * (s - c) / s
        if t.denominator == 1
          t = t.to_i
          cnt += 1 if Math.sqrt(t).to_i ** 2 == t
        end
      end
    }
  }
  cnt
end
def A070201(n)
  (1..n).map{|i| A(i)}
end
p A070201(100) # Seiichi Manyama, Oct 06 2017

A070200 Inradii of integer triangles [A070080(n), A070081(n), A070082(n)], rounded values.

Original entry on oeis.org

0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 0, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 2, 1, 2, 2, 2, 0, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 1, 1, 1, 2, 1, 2

Offset: 1

Reinhard Zumkeller, May 05 2002

nonn

Triangles [A070080(A070209(n)), A070081(A070209(n)), A070082(A070209(n))] have integer inradii = a(A070209(k))= A070210(k).

			[A070080(25), A070081(25), A070082(25)] = [3,5,6] and s = A070083(25)/2 = (3+5+6)/2 = 7: a(25) = sqrt((s-3)*(s-5)*(s-6)/7) = sqrt((7-3)*(7-5)*(7-6)/7) = sqrt(4*2*1/7) = sqrt(8/7) = 1.069, rounded = 1.

Eric Weisstein's World of Mathematics, Incircle.
R. Zumkeller, Integer-sided triangles

Cf. A070086.

a(n) = sqrt((s-u)*(s-v)*(s-w)/s), where u=A070080(n), v=A070081(n), w=A070082(n) and s=A070083(n)/2=(u+v+w)/2.

A070202 Number of integer triangles with perimeter n, integer inradius and side lengths that are not relatively prime.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 3, 0, 0, 0, 1, 0, 1

Offset: 1

Reinhard Zumkeller, May 05 2002

nonn

			For perimeter 24, only the triangle with a=6, b=8, c=10 has an integer inradius (2), therefore a(24)=1. The next examples are a(32)=1 with a=10, b=10, c=12 and a(36)=1 with a=9, b=12, c=15.

Eric Weisstein's World of Mathematics, Incircle.
Reinhard Zumkeller, Integer-sided triangles

Cf. A070138, A051493, A070109, A070209.

Definition corrected by Georg Fischer, Apr 04 2024

cp's OEIS Frontend

A070210 Inradii of integer triangles [A070080(A070209(n)), A070081(A070209(n)), A070082(A070209(n))].

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A070142 Numbers n such that [A070080(n), A070081(n), A070082(n)] is an integer triangle with integer area.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

A070201 Number of integer triangles with perimeter n having integral inradius.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Ruby

A070200 Inradii of integer triangles [A070080(n), A070081(n), A070082(n)], rounded values.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A070202 Number of integer triangles with perimeter n, integer inradius and side lengths that are not relatively prime.

Views

Author

Keywords

Examples

Links

Crossrefs

Extensions