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 15 results. Next

A106499 Ordered perimeter of primitive integer-sided triangle one of whose angles is twice another.

Original entry on oeis.org

15, 28, 40, 45, 66, 77, 84, 91, 104, 120, 126, 144, 153, 170, 187, 190, 198, 209, 220, 228, 231, 260, 273, 276, 286, 299, 312, 322, 325, 345, 350, 378, 390, 400, 420, 432, 435, 442, 459, 464, 476, 493, 496, 510, 522, 527, 544, 551, 558, 561, 570, 589, 608
Offset: 1

Views

Author

Lekraj Beedassy, May 04 2005

Keywords

Comments

For corresponding values of r and s, see A106500 and A106501.
The sides of the primitive triangle are given by the triple (r*s,s^2 - r^2,r^2).

Crossrefs

Programs

  • Mathematica
    s[p_] := Solve[1 < r < s < 2r && p == r s + s^2 && GCD[r, s] == 1, {r, s}, Integers];
    Reap[For[p = 1, p <= 10000, p++, sp = s[p]; If[sp =!= {}, Sow[p]; Print[p, " ", {r s, s^2 - r^2, r^2} /. sp[[1]]]]]][[2, 1]] (* Jean-François Alcover, Mar 06 2020 *)

Formula

a(n)=s*(r+s), where r

Extensions

Extended by Ray Chandler, May 09 2005

A106420 Length of side opposite the greater of the two angles, one being the double of the other, of a primitive integer-sided triangle, sorted on perimeter (A106499).

Original entry on oeis.org

6, 12, 15, 20, 30, 28, 35, 42, 40, 56, 45, 63, 72, 70, 66, 90, 77, 88, 99, 84, 110, 91, 104, 132, 117, 130, 143, 126, 156, 120, 154, 182, 165, 144, 195, 176, 210, 153, 170, 208, 187, 204, 240, 221, 198, 238, 255, 190, 234, 272, 209, 228, 247, 220, 266, 306, 285
Offset: 1

Author

Lekraj Beedassy and Ray Chandler, May 09 2005

Keywords

Crossrefs

Programs

  • Mathematica
    sol[p_] := Solve[1 < r < s < 2 r && p == r s + s^2 && GCD[r, s] == 1, {r, s}, Integers];
    Reap[For[p = 1, p <= 1000, p++, sp = sol[p]; If[sp =!= {}, Print[r s /. sp[[1]]]; Sow[r s /. sp[[1]]]]]][[2, 1]] (* Jean-François Alcover, Mar 07 2020 *)

Formula

a(n) = A106500(n) * A106501(n).

A106506 Length of side common to the two angles, one being the double of the other, of a primitive integer-sided triangle, sorted on perimeter (A106499).

Original entry on oeis.org

5, 7, 16, 9, 11, 33, 24, 13, 39, 15, 56, 32, 17, 51, 85, 19, 72, 57, 40, 95, 21, 120, 105, 23, 88, 69, 48, 115, 25, 161, 75, 27, 104, 175, 56, 135, 29, 208, 189, 87, 168, 145, 31, 120, 203, 93, 64, 261, 155, 33, 240, 217, 192, 279, 165, 35, 136, 231, 105, 320, 72, 37, 272
Offset: 1

Author

Lekraj Beedassy, May 04 2005

Keywords

Crossrefs

Programs

  • Mathematica
    sol[p_] := Solve[1 < r < s < 2 r && p == r s + s^2 && GCD[r, s] == 1, {r, s}, Integers];
    Reap[For[p = 1, p <= 1000, p++, sp = sol[p]; If[sp =!= {}, Print[s^2 - r^2 /. sp[[1]]]; Sow[s^2 - r^2 /. sp[[1]]]]]][[2, 1]] (* Jean-François Alcover, Mar 07 2020 *)

Formula

a(n) = A106501(n)^2 - A106500(n)^2.

Extensions

Extended by Ray Chandler, May 09 2005

A106410 Length of side opposite the lesser of the two angles, one being the double of the other, of a primitive integer-sided triangle, sorted on perimeter(A106499).

Original entry on oeis.org

4, 9, 9, 16, 25, 16, 25, 36, 25, 49, 25, 49, 64, 49, 36, 81, 49, 64, 81, 49, 100, 49, 64, 121, 81, 100, 121, 81, 144, 64, 121, 169, 121, 81, 169, 121, 196, 81, 100, 169, 121, 144, 225, 169, 121, 196, 225, 100, 169, 256, 121, 144, 169, 121, 196, 289, 225, 169, 256, 121
Offset: 1

Author

Lekraj Beedassy and Ray Chandler, May 09 2005

Keywords

Crossrefs

Programs

  • Mathematica
    sol[p_] := Solve[1 < r < s < 2 r && p == r s + s^2 && GCD[r, s] == 1, {r, s}, Integers];
    Reap[For[p = 1, p <= 1000, p++, sp = sol[p]; If[sp =!= {}, Print[r^2 /. sp[[1]]]; Sow[r^2 /. sp[[1]]]]]][[2, 1]] (* Jean-François Alcover, Mar 07 2020 *)

Formula

a(n) = A106500(n)^2.

A343065 Side b of integer-sided primitive triangles (a, b, c) whose angle B = 2*C.

Original entry on oeis.org

6, 12, 20, 30, 42, 56, 15, 72, 90, 110, 132, 35, 156, 182, 210, 240, 63, 28, 272, 306, 342, 40, 380, 99, 420, 462, 506, 552, 143, 600, 70, 650, 702, 756, 45, 195, 88, 812, 870, 930, 992, 255, 1056, 1122, 130, 1190, 1260, 77, 323, 1332, 154, 1406, 1482, 1560, 399, 1640, 1722, 66, 1806, 208, 1892, 117, 483, 1980, 2070, 238
Offset: 1

Author

Bernard Schott, Apr 11 2021

Keywords

Comments

The triples (a, b, c) are displayed in increasing order of side a, and if sides a coincide then in increasing order of the side b.
This sequence is not increasing because a(7) = 15 < a(6) = 56 (A106430).
If in triangle ABC, B = 2*C, then the corresponding metric relation between sides is a*c + c^2 = c * (a + c) = b^2.
Equivalently, length of side opposite to the greater of the two angles, one being the double of the other.
For the corresponding primitive triples and miscellaneous properties and references, see A343063.

Examples

			According to inequalities between a, b, c, there exist 3 types of such triangles:
c < a < b for the first triple (5, 6, 4) with b = 6.
c < b < a for the second triple (16, 15, 9) with b = 15.
a < c < b for the seventh triple (7, 12, 9) with b = 12.
		

Crossrefs

Cf. A335895 (similar for A < B < C in arithmetic progression).
Cf. A343063 (triples), A343064 (side a), A343066 (side c), A343067 (perimeter).
Cf. A106420 (sides b sorted on perimeter), A106430 (sides b in increasing order).

Programs

  • Maple
    for a from 2 to 100 do
    for c from 3 to floor(a^2/2) do
    d := c*(a+c);
    if issqr(d) and igcd(a,sqrt(d),c)=1 and abs(a-c)
    				

Formula

a(n) = A343063(n, 2).

A106500 Values r associated with A106499.

Original entry on oeis.org

2, 3, 3, 4, 5, 4, 5, 6, 5, 7, 5, 7, 8, 7, 6, 9, 7, 8, 9, 7, 10, 7, 8, 11, 9, 10, 11, 9, 12, 8, 11, 13, 11, 9, 13, 11, 14, 9, 10, 13, 11, 12, 15, 13, 11, 14, 15, 10, 13, 16, 11, 12, 13, 11, 14, 17, 15, 13, 16, 11, 17, 18, 13, 17, 13, 16, 19, 17, 12, 15, 13, 19, 14, 17, 20, 15, 13, 16, 19
Offset: 1

Author

Lekraj Beedassy, May 04 2005

Keywords

Crossrefs

Programs

  • Mathematica
    s[p_] := Solve[1 < r < s < 2r && p == r s + s^2 && GCD[r, s] == 1, {r, s}, Integers];
    Reap[For[p = 1, p <= 2000, p++, sp = s[p]; If[sp =!= {}, Print[r /. sp[[1]] ]; Sow[r /. sp[[1]]]]]][[2, 1]] (* Jean-François Alcover, Mar 06 2020 *)

Extensions

Extended by Ray Chandler, May 09 2005

A106505 Ordered and uniqued length of side common to the two angles, one being the double of the other, of a primitive integer-sided triangle.

Original entry on oeis.org

5, 7, 9, 11, 13, 15, 16, 17, 19, 21, 23, 24, 25, 27, 29, 31, 32, 33, 35, 37, 39, 40, 41, 43, 45, 47, 48, 49, 51, 53, 55, 56, 57, 59, 61, 63, 64, 65, 67, 69, 71, 72, 73, 75, 77, 79, 80, 81, 83, 85, 87, 88, 89, 91, 93, 95, 96, 97, 99, 101, 103, 104, 105, 107, 109, 111, 112
Offset: 1

Author

Lekraj Beedassy, May 04 2005

Keywords

Comments

The terms are proposed without repetition. For example, there exist two such triangles with a length of side = 33. They correspond respectively to s^2 - r^2 = 33 (see formula) with (r, s) = (4, 7) and sides (33, 28, 16), and the other triangle with (r, s) = (16, 17) and sides (33, 272, 256). Lengths = 39, 51, 57, 69, 75, ... correspond to two distinct triangles ... The lengths of these sides are proposed with repetition in A343064. - Bernard Schott, Apr 22 2021

Formula

Values s^2 - r^2, where r
Conjecture: for n>2, a(n+5) = a(n) + 8. - Ralf Stephan, Nov 16 2010.
Empirical g.f.: -x*(x^7+x^6+3*x^5-2*x^4-2*x^3-2*x^2-2*x-5) / ((x-1)^2*(x^4+x^3+x^2+x+1)). - Colin Barker, Oct 05 2013

Extensions

Extended by Ray Chandler, May 09 2005

A106501 Values s associated with A106499.

Original entry on oeis.org

3, 4, 5, 5, 6, 7, 7, 7, 8, 8, 9, 9, 9, 10, 11, 10, 11, 11, 11, 12, 11, 13, 13, 12, 13, 13, 13, 14, 13, 15, 14, 14, 15, 16, 15, 16, 15, 17, 17, 16, 17, 17, 16, 17, 18, 17, 17, 19, 18, 17, 19, 19, 19, 20, 19, 18, 19, 20, 19, 21, 19, 19, 21, 20, 22, 21, 20, 21, 23, 22, 23, 21, 23, 22
Offset: 1

Author

Lekraj Beedassy, May 04 2005

Keywords

Crossrefs

Extensions

Extended by Ray Chandler, May 09 2005

A246429 List of c, where c is positive integer solutions of 1/a + 1/b = 1/c and a>b>c and gcd(a,b,c)=1, sorted by ascending a, then b.

Original entry on oeis.org

2, 3, 6, 4, 12, 5, 10, 15, 6, 20, 7, 14, 30, 21, 8, 28, 35, 24, 9, 42, 18, 40, 10, 36, 56, 45, 30, 11, 22, 63, 72, 33, 12, 44, 70, 55, 13, 66, 90, 26, 77, 60, 39, 88, 14, 99, 52, 84, 110, 65, 42, 15, 78, 30, 91, 70, 16, 104, 132, 60, 117, 130
Offset: 1

Author

Albert Lau, Sep 18 2014

Keywords

Comments

For any positive integer m and n, a=m(m+n), b=n(m+n), c=m*n is an integer solution for 1/a+1/b=1/c
See A106430 for list of a, A247372 for list of b.

Examples

			1/6 + 1/3 = 1/2.
1/12 + 1/4 = 1/3.
1/15 + 1/10 = 1/6.
		

Crossrefs

Programs

  • Mathematica
    aMax = 300;
    Select[Sequence @@@ Table[{m (m + n), n (m + n), m n}, {m, Sqrt[aMax]}, {n, Min[m - 1, aMax/m - m]}], GCD @@ # == 1 &] // Sort;
    %[[;; , 3]]

A247372 List of b, where b is positive integer solutions of 1/a + 1/b = 1/c and a>b>c and gcd(a,b,c)=1, sorted by ascending a, then b.

Original entry on oeis.org

3, 4, 10, 5, 21, 6, 14, 24, 7, 36, 8, 18, 55, 30, 9, 44, 60, 33, 10, 78, 22, 65, 11, 52, 105, 70, 39, 12, 26, 112, 136, 42, 13, 60, 119, 80, 14, 102, 171, 30, 126, 85, 48, 152, 15, 180, 68, 133, 210, 90, 51, 16, 114, 34, 140, 95, 17, 168, 253, 76, 198, 230
Offset: 1

Author

Albert Lau, Sep 14 2014

Keywords

Comments

For any positive integer m and n, a=m(m+n), b=n(m+n), c=m*n is an integer solution for 1/a + 1/b = 1/c.
See A106430 for list of a, A246429 for list of c.

Examples

			1/6 + 1/3 = 1/2.
1/12 + 1/4 = 1/3.
1/15 + 1/10 = 1/6.
		

Crossrefs

Programs

  • Mathematica
    aMax = 300;
    Select[Sequence @@@ Table[{m (m + n), n (m + n), m n}, {m, Sqrt[aMax]}, {n, Min[m - 1, aMax/m - m]}], GCD @@ # == 1 &] // Sort;
    %[[;;, 2]]
Showing 1-10 of 15 results. Next