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-5 of 5 results.

A046131 Areas of scalene integer Heronian triangles (A046128, A046129, A046130) sorted by increasing c and b.

Original entry on oeis.org

6, 24, 30, 54, 24, 84, 36, 60, 66, 42, 96, 84, 126, 90, 150, 84, 120, 36, 204, 210, 210, 60, 216, 132, 96, 336, 72, 144, 240, 294, 84, 252, 360, 114, 156, 180, 210, 120, 210, 420, 168, 270, 264, 168, 384, 240, 468, 126, 180, 336, 336, 504, 264, 330, 486, 216
Offset: 0

Views

Author

Keywords

Comments

This is the ordering of triangles used for A316841.

Crossrefs

The sides are given by A046128, A046129, A046130.
Range of values: A383413.

Programs

  • Mathematica
    sideMax = 60; r[c_] := Reap[Do[ p = (a + b + c)/2; red = Reduce[ area > 1 && a < b < c && area^2 == p*(p - a)*(p - b)*(p - c), area, Integers]; If[red =!= False, sol = {a, b, c, area} /. {ToRules[red]}; Sow[sol]], {b, 1, c - 1}, {a, c - b, b - 1}]]; triangles = Flatten[ Reap[ Do[rc = r[c]; If[rc[[2]] =!= {}, Sow[rc[[2, 1]]]], {c, 5, sideMax}]][[2, 1]] , 2]; Sort[ triangles, Which[#1[[3]] < #2[[3]], True, #1[[3]] > #2[[3]], False, #1[[2]] < #2[[2]], True,  #1[[2]] > #2[[2]], False, #1[[1]] <= #2[[1]], True, True, False] &][[All, 4]] (* Jean-François Alcover, Oct 29 2012 *)

A070080 Smallest side of integer triangles [a(n) <= A070081(n) <= A070082(n)], sorted by perimeter, lexicographically ordered.

Original entry on oeis.org

1, 1, 2, 1, 2, 2, 1, 2, 3, 2, 3, 1, 2, 3, 3, 2, 3, 4, 1, 2, 3, 3, 4, 2, 3, 4, 4, 1, 2, 3, 3, 4, 4, 5, 2, 3, 4, 4, 5, 1, 2, 3, 3, 4, 4, 5, 5, 2, 3, 4, 4, 5, 5, 6, 1, 2, 3, 3, 4, 4, 5, 5, 5, 6, 2, 3, 4, 4, 5, 5, 6, 6, 1, 2, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 2, 3, 4, 4, 5, 5
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Crossrefs

Cf. A316841, A316843, A316844, A316845 (sides (i,j,k) with j + k > i >= j >= k >= 1).
Cf. A331244, A331245, A331246 (similar, but triangles sorted by radius of enclosing circle), A331251, A331252, A331253 (triangles sorted by area), A331254, A331255, A331256 (triangles sorted by radius of circumcircle).

Programs

  • Mathematica
    m = 55 (* max perimeter *);
    sides[per_] := Select[Reverse /@ IntegerPartitions[per, {3}, Range[ Ceiling[per/2]]], #[[1]] < per/2 && #[[2]] < per/2 && #[[3]] < per/2&];
    triangles = DeleteCases[Table[sides[per], {per, 3, m}], {}] // Flatten[#, 1]& // SortBy[Total[#] m^3 + #[[1]] m^2 + #[[2]] m + #[[1]]&];
    triangles[[All, 1]] (* Jean-François Alcover, Jun 12 2012, updated Jul 09 2017 *)

Formula

a(n) = A070083(n) - A070082(n) - A070081(n).

A046129 Middle side b of scalene integer Heronian triangles sorted by increasing c and b.

Original entry on oeis.org

4, 8, 12, 12, 13, 14, 10, 15, 13, 15, 16, 17, 20, 17, 20, 24, 24, 25, 25, 25, 21, 25, 24, 25, 26, 28, 29, 20, 30, 28, 29, 34, 29, 20, 26, 30, 35, 25, 28, 34, 35, 36, 26, 30, 32, 37, 39, 28, 40, 40, 34, 40, 37, 39, 36, 39, 40, 42, 35, 34, 40, 41, 41, 48, 30, 35, 37, 38, 40
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    sideMax = 60; r[c_] := Reap[Do[ p = (a + b + c)/2; red = Reduce[ area > 1 && a < b < c && area^2 == p*(p - a)*(p - b)*(p - c), area, Integers]; If[red =!= False, sol = {a, b, c, area} /. {ToRules[red]}; Sow[sol]], {b, 1, c - 1}, {a, c - b, b - 1}]]; triangles = Flatten[ Reap[ Do[rc = r[c]; If[rc[[2]] =!= {}, Sow[rc[[2, 1]]]], {c, 5, sideMax}]][[2, 1]] , 2]; Sort[ triangles, Which[#1[[3]] < #2[[3]], True, #1[[3]] > #2[[3]], False, #1[[2]] < #2[[2]], True,  #1[[2]] > #2[[2]], False, #1[[1]] <= #2[[1]], True, True, False] &][[All, 2]] (* Jean-François Alcover, Oct 29 2012 *)

A046130 Largest side c of a scalene integer Heronian triangles sorted by increasing c and b.

Original entry on oeis.org

5, 10, 13, 15, 15, 15, 17, 17, 20, 20, 20, 21, 21, 25, 25, 25, 26, 26, 26, 28, 29, 29, 30, 30, 30, 30, 30, 34, 34, 35, 35, 35, 36, 37, 37, 37, 37, 39, 39, 39, 39, 39, 40, 40, 40, 40, 40, 41, 41, 41, 42, 42, 44, 44, 45, 45, 45, 45, 48, 50, 50, 50, 50, 50, 51, 51, 51, 51, 51
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    sideMax = 60; r[c_] := Reap[Do[ p = (a + b + c)/2; red = Reduce[ area > 1 && a < b < c && area^2 == p*(p - a)*(p - b)*(p - c), area, Integers]; If[red =!= False, sol = {a, b, c, area} /. {ToRules[red]}; Sow[sol]], {b, 1, c - 1}, {a, c - b, b - 1}]]; triangles = Flatten[ Reap[ Do[rc = r[c]; If[rc[[2]] =!= {}, Sow[rc[[2, 1]]]], {c, 5, sideMax}]][[2, 1]] , 2]; Sort[ triangles, Which[#1[[3]] < #2[[3]], True, #1[[3]] > #2[[3]], False, #1[[2]] < #2[[2]], True,  #1[[2]] > #2[[2]], False, #1[[1]] <= #2[[1]], True, True, False] &][[All, 3]] (* Jean-François Alcover, Oct 29 2012 *)

A336272 Length of longest side of a primitive square Heron triangle, i.e., a triangle with relatively prime integer sides and area the square of a positive integer.

Original entry on oeis.org

17, 26, 120, 370, 392, 567, 680, 697, 847, 1066, 1089, 1183, 1233, 1299, 1371, 1448, 1904, 2009, 2169, 2176, 2281, 2307, 2535, 2600, 2619, 2785, 2845, 2993, 3150, 3370, 3825, 3944, 3983, 4035, 4095, 4290, 4706, 4760, 4879, 4905, 5655, 5811, 5835, 6137, 6375, 6570, 6936, 7202, 7913, 7995
Offset: 1

Views

Author

James R. Buddenhagen, Jul 15 2020

Keywords

Comments

The triangle [a(23)=2535, 2329, 544] with gcd(2329, 544) = 17 is the first square Heron triangle for which the 3 sides [i, j, k] are not pairwise coprime, i.e., max(gcd(i,j), gcd(i,k), gcd(j,k)) > 1, but gcd(i,j,k) = 1. Are there more square Heron triangles with this property? - Hugo Pfoertner, Jul 18 2020
There are other square Heron triangles with this property, e.g. [a(31)=3825, 2704, 1921] with gcd(1921, 3825) = 17; [a(??)=41460721, 38639097, 17536520] with gcd(38639097, 17536520) = 41; [a(??)=153915025, 139641489, 25224736] with gcd(25224736, 153915025) = 17; and [a(??)=4325561361, 3459908000, 1430190961] with gcd(3459908000, 1430190961) = 73. - James R. Buddenhagen, Jul 20 2020
Terms are given with multiplicity, e.g. if there are two primitive square Heron triangles with equal longest sides, that longest side is listed as a term of the sequence twice (this is very rare). - James R. Buddenhagen, Jul 21 2020

Examples

			17 is in the sequence because the triangle with sides [17, 10, 9] has longest side 17 and area 6^2, the square of a positive integer; 26 is in the sequence because the triangle with sides [26, 25, 3] has longest side 26 and has area 6^2, the square of a positive integer.
Triangles with sides [a, b, c] corresponding to the first 8 terms of this sequence are:  [17, 10, 9], [26, 25, 3], [120, 113, 17], [370, 357, 41], [392, 353, 255], [567, 424, 305], [680, 441, 337], [697, 657, 104].
		

Crossrefs

Programs

  • Maple
    # find all square Heron triangles whose longest side is between small and big
    small:=1: big:=700:
    A336272:=[]:triangles:=[]:
    areasq16:=(a+b+c)*(a+b-c)*(a-b+c)*(-a+b+c):
    # a>=b>=c
    for a from small to big do:
      for b from ceil((a+1)/2) to a do:
        for c from a-b+1 to b do:
          if issqr(areasq16) and issqr(sqrt(areasq16)) and igcd(a,b,c)=1 then
            A336272:=[op(A336272),a]:
            triangles:=[op(triangles),[a,b,c]]:
          end if:
        od:
      od:
    od: A336272;triangles;
  • PARI
    for(a=1,1200,for(b=ceil((a+1)/2),a,for(c=a-b+1,b,if(gcd([a,b,c])==1,if(ispower((a+b+c)*(a+b-c)*(a-b+c)*(b+c-a),4),print1(a,", ")))))) \\ Hugo Pfoertner, Jul 18 2020

Extensions

a(42)-a(50) from Hugo Pfoertner, Jul 18 2020
Showing 1-5 of 5 results.