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-10 of 27 results. Next

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

Links

Crossrefs

Cf. A046128, A055594, A069597.
Cf. A070081, A070082, A070083, A070084, A070085, A070086.
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).

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

Original entry on oeis.org

1, 2, 2, 3, 2, 3, 4, 3, 3, 4, 3, 5, 4, 3, 4, 5, 4, 4, 6, 5, 4, 5, 4, 6, 5, 4, 5, 7, 6, 5, 6, 4, 5, 5, 7, 6, 5, 6, 5, 8, 7, 6, 7, 5, 6, 5, 6, 8, 7, 6, 7, 5, 6, 6, 9, 8, 7, 8, 6, 7, 5, 6, 7, 6, 9, 8, 7, 8, 6, 7, 6, 7, 10, 9, 8, 9, 7, 8, 6, 7, 8, 6, 7, 7, 10, 9, 8, 9, 7
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Links

Crossrefs

Cf. A046129, A055593, A069595, A069594, A069598.
Cf. A070080, A070082, A070083, A070084, A070085, A070086.

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, 2]] (* Jean-François Alcover, Jul 09 2017 *)

Formula

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

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

Original entry on oeis.org

1, 2, 2, 3, 3, 3, 4, 4, 3, 4, 4, 5, 5, 5, 4, 5, 5, 4, 6, 6, 6, 5, 5, 6, 6, 6, 5, 7, 7, 7, 6, 7, 6, 5, 7, 7, 7, 6, 6, 8, 8, 8, 7, 8, 7, 7, 6, 8, 8, 8, 7, 8, 7, 6, 9, 9, 9, 8, 9, 8, 9, 8, 7, 7, 9, 9, 9, 8, 9, 8, 8, 7, 10, 10, 10, 9, 10, 9, 10, 9, 8, 9, 8, 7, 10, 10
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Links

Crossrefs

Cf. A046130, A055592, A069598, A069597.
Cf. A070080, A070081, A070083, A070084, A070085, A070086.

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, 3]] (* Jean-François Alcover, Jul 09 2017 *)

Formula

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

A070093 Number of acute integer triangles with perimeter n.

Original entry on oeis.org

0, 0, 1, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 2, 4, 3, 5, 4, 5, 5, 5, 6, 6, 6, 7, 7, 9, 8, 10, 9, 10, 10, 11, 12, 12, 12, 14, 13, 16, 14, 17, 16, 17, 18, 18, 20, 20, 20, 22, 22, 24, 23, 25, 26, 26, 27, 28, 30, 30, 29, 32, 31, 35, 33, 36, 36, 38, 39, 40, 40
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Comments

An integer triangle [A070080(k) <= A070081(k) <= A070082(k)] is acute iff A070085(k) > 0.

Examples

			For n=9 there are A005044(9)=3 integer triangles: [1,4,4], [2,3,4] and [3,3,3]; two of them are acute, as 2^2+3^2<16=4^2, therefore a(9)=2.

Links

Crossrefs

Cf. A070094, A070095, A070118.
Cf. A005044, A024155, A070101.

Programs

  • Mathematica
    Table[Sum[Sum[(1 - Sign[Floor[(n - i - k)^2/(i^2 + k^2)]]) Sign[Floor[(i + k)/(n - i - k + 1)]], {i, k, Floor[(n - k)/2]}], {k, Floor[n/3]}], {n, 100}] (* Wesley Ivan Hurt, May 12 2019 *)

Formula

a(n) = A005044(n) - A070101(n) - A024155(n);
a(n) = A042154(n) + A070098(n).
a(n) = Sum_{k=1..floor(n/3)} Sum_{i=k..floor((n-k)/2)} (1-sign(floor((n-i-k)^2/(i^2+k^2)))) * sign(floor((i+k)/(n-i-k+1))). - Wesley Ivan Hurt, May 12 2019

A070101 Number of obtuse integer triangles with perimeter n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 2, 0, 2, 2, 3, 2, 3, 3, 5, 3, 7, 4, 8, 5, 9, 7, 10, 8, 11, 9, 14, 11, 16, 12, 18, 14, 19, 17, 21, 18, 23, 21, 27, 22, 30, 24, 32, 27, 34, 30, 37, 33, 40, 35, 44, 37, 47, 40, 50, 44, 53, 49, 56, 52, 60, 55, 64, 57, 68
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Comments

An integer triangle [A070080(k) <= A070081(k) <= A070082(k)] is obtuse iff A070085(k) < 0.

Examples

			For n=14 there are A005044(14)=4 integer triangles: [2,6,6], [3,5,6], [4,4,6] and [4,5,5]; two of them are obtuse, as 3^2+5^2<36=6^2 and 4^2+4^2<36=6^2, therefore a(14)=2.

Links

Crossrefs

Cf. A070102, A070103, A070127.
Cf. A005044, A024155, A070093.

Programs

  • Mathematica
    Table[Sum[Sum[(1 - Sign[Floor[(i^2 + k^2)/(n - i - k)^2]]) Sign[Floor[(i + k)/(n - i - k + 1)]], {i, k, Floor[(n - k)/2]}], {k, Floor[n/3]}], {n, 100}] (* Wesley Ivan Hurt, May 12 2019 *)

Formula

a(n) = A005044(n) - A070093(n) - A024155(n).
a(n) = A024156(n) + A070106(n).
a(n) = Sum_{k=1..floor(n/3)} Sum_{i=k..floor((n-k)/2)}
(1-sign(floor((i^2 + k^2)/(n-i-k)^2))) * sign(floor((i+k)/(n-i-k+1))). - Wesley Ivan Hurt, May 12 2019

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

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 9, 10, 11, 12, 15, 16, 18, 19, 22, 23, 24, 27, 28, 31, 33, 34, 35, 38, 39, 40, 43, 45, 46, 47, 48, 51, 53, 54, 55, 58, 60, 63, 64, 65, 68, 70, 71, 72, 73, 76, 81, 83, 84, 85, 88, 90, 92, 93, 94, 95, 98, 103, 106, 107, 108
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Examples

			a(21)=33: [A070080(33), A070081(33), A070082(33)]=[4,5,6], A070085(33)=4^2+5^2-6^2=16+25-36=5>0.

Links

Crossrefs

Cf. A070093, A070119, A070120, A070121, A070122, A070123, A070124, A070125, A070126.

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_} /; a^2 + b^2 - c^2 > 0] // 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 *)

A070122 Numbers m such that [A070080(m), A070081(m), A070082(m)] is an acute scalene integer triangle with relatively prime side lengths.

Original entry on oeis.org

33, 45, 53, 60, 70, 83, 90, 92, 106, 114, 119, 132, 134, 142, 148, 162, 165, 168, 175, 181, 183, 197, 200, 203, 204, 218, 224, 237, 240, 245, 247, 261, 264, 267, 268, 282, 290, 293, 296, 309, 316, 317, 319, 333, 341, 345, 348
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Examples

			70 is a term because [A070080(70), A070081(70), A070082(70)]=[5<7<8], A070084(70)=gcd(5,7,8)=1, A070085(70)=5^2+7^2-8^2=25+49-64=10>0.

Links

Crossrefs

Cf. A070096, A070118, A070110, A070112.

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 < b < c && GCD[a, b, c] == 1 && a^2 + b^2 - c^2 > 0] // Flatten (* Jean-François Alcover, Oct 12 2021 *)

A070123 Numbers m such that [A070080(m), A070081(m), A070082(m)] is an acute scalene integer triangle with prime side lengths.

Original entry on oeis.org

240, 544, 799, 911, 1262, 1568, 2621, 2681, 2856, 3369, 3648, 4246, 5194, 5541, 6576, 6626, 6725, 7441, 7503, 7565, 7902, 7944, 8882, 8956, 9332, 9452, 9472, 9888, 9988, 10421, 10498, 10502, 11075, 11079, 11622
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Examples

			240 is a term because: [A070080(240), A070081(240), A070082(240)]=[7<11<13], A070085(240)=7^2+11^2-13^2=49+121-169=1>0.

Links

Crossrefs

Cf. A070097, A070118, A070111, A070112.

Programs

  • Mathematica
    m = 500 (* 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 < b < c && AllTrue[{a, b, c}, PrimeQ] && a^2 + b^2 - c^2 > 0] // Flatten (* Jean-François Alcover, Oct 12 2021 *)

A070125 Numbers n such that [A070080(n), A070081(n), A070082(n)] is an acute isosceles integer triangle with relatively prime side lengths.

Original entry on oeis.org

1, 2, 4, 6, 7, 11, 12, 15, 16, 19, 22, 23, 27, 28, 35, 39, 40, 43, 46, 47, 51, 55, 58, 63, 64, 65, 72, 73, 81, 88, 94, 95, 98, 103, 107, 108, 109, 121, 124, 135, 136, 140, 150, 151, 159, 166, 167, 170, 178, 185, 186, 189, 194, 201, 205
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Examples

			a(14)=22: [A070080(22), A070081(22), A070082(22)]=[3<5=5], A070084(22)=gcd(3,5,5)=1, A070085(22)=3^2+5^2-5^2=9>0.

Links

Crossrefs

Cf. A070099, A070115, A070110, A070118.
Showing 1-10 of 27 results. Next

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

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