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.

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.
		

Crossrefs

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 *)

A070111 Numbers k such that [A070080(k), A070081(k), A070082(k)] is an integer triangle with prime sides.

Original entry on oeis.org

3, 5, 6, 9, 14, 16, 22, 30, 34, 35, 43, 46, 63, 84, 101, 109, 124, 133, 153, 159, 163, 170, 189, 193, 201, 234, 240, 286, 297, 328, 334, 350, 352, 382, 392, 410, 444, 450, 454, 472, 478, 479, 515, 519, 527, 542, 544, 597, 603, 621, 629, 688, 708, 714, 771, 777, 795, 799, 811, 817, 868, 878, 900, 907, 911
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Examples

			35 is a term: [A070080(35), A070081(35), A070082(35)]=[2,7,7].
		

Crossrefs

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_} /; AllTrue[{a, b, c}, PrimeQ]] // Flatten (* Jean-François Alcover, Oct 04 2021 *)

Extensions

More terms from Jean-François Alcover, Oct 04 2021

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

Original entry on oeis.org

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

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Examples

			For n=11 there are A005044(11)=4 integer triangles: [1,5,5], [2,4,5], [3,3,5] and [3,4,4]; only one of the two obtuses ([2,4,5] and [3,3,5]) consists of primes, therefore a(11)=1.
		

Crossrefs

Programs

  • Mathematica
    Table[Sum[Sum[(PrimePi[i] - PrimePi[i - 1]) (PrimePi[k] - PrimePi[k - 1]) (PrimePi[n - i - k] - PrimePi[n - i - k - 1]) (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 13 2019 *)

Formula

a(n) = A070093(n) - A070098(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))) * A010051(i) * A010051(k) * A010051(n-i-k). - Wesley Ivan Hurt, May 13 2019
Showing 1-3 of 3 results.