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

A070084 Greatest common divisor of sides of integer triangles [A070080(n), A070081(n), A070082(n)], sorted by perimeter, sides lexicographically ordered.

Original entry on oeis.org

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

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Comments

a(n)>1 iff there exists a smaller similar triangle [A070080(k), A070081(k), A070082(k)] with kA070080(n)=A070080(k)*a(n), A070081(n)=A070081(k)*a(n) and A070082(n)=A070082(k)*a(n).

Links

Crossrefs

Cf. A051493, A005044, A070091, A070094, A070102, A070109, A070110, A070113, A070116, A070119, A070128, A070137.

Programs

  • Mathematica
    maxPer = 22; maxSide = Floor[(maxPer - 1)/2]; order[{a_, b_, c_}] := (a + b + c)*maxPer^3 + a*maxPer^2 + b*maxPer + c; triangles = Reap[Do[If[a + b + c <= maxPer && 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]]; GCD @@@ Sort[triangles, order[#1] < order[#2] &] (* Jean-François Alcover, May 27 2013 *)

Formula

a(n) = GCD(A070080(n), A070081(n), A070082(n)).

A070110 Numbers k such that [A070080(k), A070081(k), A070082(k)] is an integer triangle with relatively prime side lengths.

Original entry on oeis.org

1, 2, 4, 5, 6, 7, 8, 11, 12, 13, 14, 15, 16, 17, 19, 20, 21, 22, 23, 25, 27, 28, 29, 30, 32, 33, 35, 36, 37, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 51, 52, 53, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 69, 70, 72, 73, 74, 75, 77
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Comments

A070084(a(k)) = gcd(A070080(a(k)), A070081(a(k)), A070082(a(k))) = 1;
all integer triangles [A070080(a(k)), A070081(a(k)), A070082(a(k))] are mutually nonisomorphic.

Examples

			13 is a term: [A070080(13), A070081(13), A070082(13)]=[2,4,5], A070084(13)=gcd(2,4,5)=1.

Links

Crossrefs

Cf. A051493, A070113, A070116, A070119, A070122, A070125, A070128, A070131, A070134, A070137, A070084.

Programs

  • Mathematica
    m = 50 (* 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]] &];
Position[triangles, {a_, b_, c_} /; GCD[a, b, c] == 1] // Flatten (* Jean-François Alcover, Oct 04 2021 *)

A070127 Numbers n such that [A070080(n), A070081(n), A070082(n)] is an obtuse integer triangle.

Original entry on oeis.org

5, 8, 13, 14, 20, 21, 25, 26, 29, 30, 32, 36, 37, 41, 42, 44, 49, 50, 52, 56, 57, 59, 61, 62, 66, 67, 69, 74, 75, 77, 78, 79, 80, 82, 86, 87, 89, 91, 96, 97, 99, 100, 101, 102, 104, 105, 110, 111, 113, 115, 118, 122, 123, 125, 126, 127
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Examples

			a(10)=30: [A070080(30), A070081(30), A070082(30)]=[3,5,7], A070085(30)=3^2+5^2-7^2=9+25-49=-15<0.

Links

Crossrefs

Cf. A070101, A070129, A070130, A070131, A070132, A070133, A070134, A070135, A070128, A070085.

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]]&];
Position[triangles, {a_, b_, c_} /; a^2 + b^2 - c^2 < 0] // Flatten (* Jean-François Alcover, Oct 11 2021 *)

A070102 Number of obtuse integer triangles with perimeter n and relatively prime side lengths.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 2, 0, 2, 1, 3, 2, 3, 2, 5, 3, 6, 2, 8, 5, 9, 5, 9, 6, 11, 6, 14, 9, 14, 9, 17, 11, 19, 12, 19, 15, 23, 13, 27, 18, 26, 16, 32, 20, 33, 21, 34, 26, 40, 23, 42, 29, 42, 29, 50, 32, 53, 35, 48, 41, 58, 37, 64, 45, 60, 42, 71
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Comments

a(n) = A051493(n) - A070094(n) - A070109(n).

Examples

			For n=9 there are A005044(9)=3 integer triangles: [1,4,4], [2,3,4] and [3,3,3]; only one of them is obtuse: 2^2+3^2<16=4^2 and GCD(2,3,4)=1, therefore a(9)=1.

Links

Crossrefs

Cf. A070080, A070081, A070082, A070101, A051493, A070104, A070107, A070084, A070128.
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.