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.

A229849 Consider all primitive 120-degree triangles with sides A < B < C. The sequence gives the values of B.

Original entry on oeis.org

5, 8, 16, 24, 33, 35, 39, 45, 51, 56, 57, 63, 77, 80, 85, 88, 91, 95, 105, 112, 115, 120, 143, 145, 155, 160, 161, 165, 168, 175, 187, 192, 195, 203, 208, 209, 217, 221, 224, 231, 247, 253, 259, 261, 272, 273, 279, 280, 287, 288, 299, 301, 304, 315, 320, 323
Offset: 1

Views

Author

Colin Barker, Oct 06 2013

Keywords

Comments

A primitive triangle is one for which the sides have no common factor.
For n>1, A106505(n) seems to give the values of A and A004611(n) seems to give the values of C.

Examples

			33 appears in the sequence because there exists a primitive 120-degree triangle with sides 7, 33 and 37.
		

Crossrefs

Programs

  • PARI
    \\ Gives values of B not exceeding bmax
    \\ e.g. pt120b(80) gives [5, 8, 16, 24, 33, 35, 39, 45, 51, 56, 57, 63, 77, 80]
    pt120b(bmax) = {
      s=[];
      for(m=1, (bmax-1)\2,
        for(n=1, m-1,
          if((m-n)%3!=0 && gcd(m, n)==1,
            a=m*m-n*n;
            b=n*(2*m+n);
            if(a>b, b=a);
            if(b<=bmax, s=concat(s, b))
          )
        )
      );
      vecsort(s,,8)
    }

A229858 Consider all 120-degree triangles with sides A < B < C. The sequence gives the values of A.

Original entry on oeis.org

3, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70
Offset: 1

Views

Author

Colin Barker, Oct 06 2013

Keywords

Comments

A229859 gives the values of B, and A050931 gives the values of C.
This sequence contains every integer larger than 8. - Nathaniel Johnston, Oct 06 2013

Examples

			12 appears in the sequence because there exists a 120-degree triangle with sides 12, 20 and 28.
		

Crossrefs

Programs

  • PARI
    \\ Gives values of A not exceeding amax.
    \\ e.g. t120a(20) gives [3, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]
    t120a(amax) = {
      v=pt120a(amax);
      s=[];
      for(i=1, #v,
        for(m=1, amax\v[i],
          if(v[i]*m<=amax, s=concat(s, v[i]*m))
        )
      );
      vecsort(s,,8)
    }
    \\ Gives values of A not exceeding amax in primitive triangles.
    \\ e.g. pt120a(20) gives [3, 5, 7, 9, 11, 13, 15, 16, 17, 19]
    pt120a(amax) = {
      s=[];
      for(m=1, (amax-1)\2,
        for(n=1, m-1,
          if((m-n)%3!=0 && gcd(m, n)==1,
            a=m*m-n*n;
            b=n*(2*m+n);
            if(a>b, a=b);
            if(a<=amax, s=concat(s, a))
          )
        )
      );
      vecsort(s,,8)
    }

Formula

a(n) = n+4 for n>4.
a(n) = 2*a(n-1)-a(n-2) for n>6.
G.f.: -x*(x^5-x^4+x^2+x-3) / (x-1)^2.

A264827 (a,b,c) in lexicographic order such that a^2 + b^2 + a*b - c^2 = 0 with a < b < c and gcd(a, b) = 1.

Original entry on oeis.org

3, 5, 7, 5, 16, 19, 7, 8, 13, 7, 33, 37, 9, 56, 61, 11, 24, 31, 11, 85, 91, 13, 35, 43, 13, 120, 127, 15, 161, 169, 16, 39, 49, 17, 63, 73, 17, 208, 217, 19, 80, 91, 19, 261, 271, 21, 320, 331, 23, 120, 133, 23, 385, 397, 24, 95, 109, 25, 143, 157
Offset: 1

Views

Author

Colin Barker, Nov 26 2015

Keywords

Comments

The sides of a primitive 120-degree integer triangle.

Examples

			Triples (a,b,c) begin:
  3,  5,  7;
  5, 16, 19;
  7,  8, 13;
  7, 33, 37;
  9, 56, 61;
  ...
		

Crossrefs

Programs

  • PARI
    pt120(a) = {
      my(L=List(), n=-3*a^2, f, g, b, c);
      fordiv(n, f,
        g=n\f;
        if(f>g && (g+f)%2==0 && (f-g)%4==0,
          c=(f-g)\4; b=((f+g)\2-a)\2;
          if(b>0 && a
    				

A357276 Middle side of integer-sided primitive triangles whose angles satisfy A < B < C = 2*Pi/3 = 120 degrees.

Original entry on oeis.org

5, 8, 16, 24, 33, 35, 39, 56, 45, 63, 51, 85, 80, 57, 77, 95, 120, 120, 88, 91, 115, 143, 112, 161, 105, 175, 165, 195, 208, 160, 168, 145, 224, 203, 187, 221, 155, 261, 217, 192, 279, 209, 288, 247, 320, 272, 323, 280, 231, 315, 273, 259, 385, 357, 333, 304, 399, 352, 253, 407, 299, 287, 440
Offset: 1

Author

Bernard Schott, Sep 25 2022

Keywords

Comments

The triples of sides (a,b,c) with a < b < c are in nondecreasing order of largest side c, and if largest sides coincide, then by increasing order of the smallest side. This sequence lists the b's.
For the corresponding primitive triples and miscellaneous properties and references, see A357274.
Solutions b of the Diophantine equation c^2 = a^2 + a*b + b^2 with gcd(a,b) = 1 and a < b.
Also, b is generated by integers u, v such that gcd(u,v) = 1 and 0 < v < u, with b = 2*u*v + v^2.
This sequence is not increasing. For example, a(8) = 56 for triangle with largest side c = 61 while a(9) = 45 for triangle with largest side c = 67.
Differs from A088586, the first 20 terms are the same then a(21) = 115 while A088586(21) = 143.
A229849 gives all the possible values of the middle side b, in increasing order without repetition, for primitive triples, while A229859 gives all the possible values of the middle side b, in increasing order without repetition, but for all triples, not necessarily primitive.

Examples

			a(17) = a(18) = 120 since 17th and 18th triples are respectively (13, 120, 127) and (23, 120, 133).
		

Crossrefs

Cf. A357274 (triples), A357275 (smallest side), this sequence (middle side), A357277 (largest side), A357278 (perimeter).
Cf. also A088586, A229849, A229859.

Programs

  • Maple
    for c from 5 to 500 by 2 do
    for a from 3 to c-2 do
    b := (-a + sqrt(4*c^2-3*a^2))/2;
    if b=floor(b) and gcd(a,b)=1 and a
    				
Showing 1-4 of 4 results.