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.

A386308 Long legs of Pythagorean triples that do not have the form (u^2 - v^2, 2*u*v, u^2 + v^2) ordered by increasing hypotenuse (A386307), where u and v are positive integers.

Original entry on oeis.org

12, 20, 24, 28, 36, 40, 45, 44, 48, 52, 60, 56, 60, 72, 72, 68, 75, 63, 84, 76, 80, 90, 84, 88, 105, 92, 105, 96, 120, 120, 104, 120, 108, 112, 132, 105, 116, 120, 144, 124, 144, 135, 132, 156, 136, 150, 126, 140, 168, 168, 180, 148, 175, 165, 152, 156, 168, 180
Offset: 1

Views

Author

Felix Huber, Aug 19 2025

Keywords

Comments

In the form (u^2 - v^2, 2*u*v, u^2 + v^2), u^2 + v^2 is the hypotenuse, max(u^2 - v^2, 2*u*v) is the long leg and min(u^2 - v^2, 2*u*v) is the short leg.

Examples

			The Pythagorean triple (9, 12, 15) does not have the form (u^2 - v^2, 2*u*v, u^2 + v^2), because 15 is not a sum of two nonzero squares. Therefore 12 is a term.

Links

Crossrefs

Subsequence of A046084.
Cf. A366675, A380073, A386307, A386309, A386944.

Programs

  • Maple
    A386308:=proc(N) # To get all terms with hypotenuses <= N
    local i,l,m,u,v,r,x,y,z;
    l:={};
    m:={};
    for u from 2 to floor(sqrt(N-1)) do
        for v to min(u-1,floor(sqrt(N-u^2))) do
            x:=min(2*u*v,u^2-v^2);
            y:=max(2*u*v,u^2-v^2);
            z:=u^2+v^2;
            m:=m union {[z,y,x]};
            if gcd(u,v)=1 and is(u-v,odd) then
                l:=l union {seq([i*z,i*y,i*x],i=1..N/z)}
            fi
        od
    od;
    r:=l minus m;
    return seq(r[i,2],i=1..nops(r));
end proc;
A386308(1000);

Formula

a(n) = sqrt(A386307(n)^2 - A386309(n)^2).
{A046084(n)} = {a(n)} union {A046087(n)} union {A386944(n)}.

A386309 Short legs of Pythagorean triples that do not have the form (u^2 - v^2, 2*u*v, u^2 + v^2) ordered by increasing hypotenuse (A386307), where u and v are positive integers.

Original entry on oeis.org

9, 15, 18, 21, 15, 30, 24, 33, 36, 39, 25, 42, 45, 21, 30, 51, 40, 60, 35, 57, 60, 48, 63, 66, 36, 69, 56, 72, 27, 35, 78, 50, 81, 84, 55, 100, 87, 90, 42, 93, 60, 84, 99, 65, 102, 80, 120, 105, 49, 70, 33, 111, 60, 88, 114, 117, 99, 75, 48, 120, 140, 96, 123, 45
Offset: 1

Views

Author

Felix Huber, Aug 19 2025

Keywords

Comments

In the form (u^2 - v^2, 2*u*v, u^2 + v^2), u^2 + v^2 is the hypotenuse, max(u^2 - v^2, 2*u*v) is the long leg and min(u^2 - v^2, 2*u*v) is the short leg.

Examples

			The Pythagorean triple (9, 12, 15) does not have the form (u^2 - v^2, 2*u*v, u^2 + v^2), because 15 is not a sum of two nonzero squares. Therefore 12 is a term.

Links

Crossrefs

Subsequence of A046083.
Cf. A366674, A380074, A386307, A386308, A386945.

Programs

  • Maple
    A386309:=proc(N) # To get all terms with hypotenuses <= N
    local i,l,m,u,v,r,x,y,z;
    l:={};
    m:={};
    for u from 2 to floor(sqrt(N-1)) do
        for v to min(u-1,floor(sqrt(N-u^2))) do
            x:=min(2*u*v,u^2-v^2);
            y:=max(2*u*v,u^2-v^2);
            z:=u^2+v^2;
            m:=m union {[z,y,x]};
            if gcd(u,v)=1 and is(u-v,odd) then
                l:=l union {seq([i*z,i*y,i*x],i=1..N/z)}
            fi
        od
    od;
    r:=l minus m;
    return seq(r[i,3],i=1..nops(r));
end proc;
A386309(1000);

Formula

a(n) = sqrt(A386307(n)^2 - A386308(n)^2).
{A046083(n)} = {a(n)} union {A046086(n)} union {A386945(n)}.

A386943 Ordered hypotenuses of nonprimitive Pythagorean triples of the form (u^2 - v^2, 2*u*v, u^2 + v^2), where u and v are positive integers.

Original entry on oeis.org

10, 20, 26, 34, 40, 45, 50, 52, 58, 68, 74, 80, 82, 90, 100, 104, 106, 116, 117, 122, 125, 130, 130, 136, 146, 148, 153, 160, 164, 170, 170, 178, 180, 194, 200, 202, 208, 212, 218, 225, 226, 232, 234, 244, 245, 250, 250, 260, 260, 261, 272, 274, 290, 290, 292, 296
Offset: 1

Views

Author

Felix Huber, Aug 24 2025

Keywords

Comments

In the form (u^2 - v^2, 2*u*v, u^2 + v^2), u^2 + v^2 is the hypotenuse, max(u^2 - v^2, 2*u*v) is the long leg and min(u^2 - v^2, 2*u*v) is the short leg.
A101930(n) gives the total number of Pythagorean triples <= 10^n.
number of terms <= h total number of
h in this sequence hypotenuses <= h percentage
10 1 2 50.0 %
100 15 52 28.8 %
1000 209 881 23.7 %
10000 2249 12471 18.0 %
100000 23086 161436 14.3 %

Examples

			The nonprimitive Pythagorean triple (6, 8, 10) is of the form (u^2 - v^2, 2*u*v, u^2 + v^2): From u = 3 and v = 1 follows u^2 - v^2 = 8 (long leg), 2*u*v = 6 (short leg), u^2 - v^2 = 10 (hypotenuse). Therefore, 10 is a term.

Links

Crossrefs

Subsequence of A009000.
Cf. A020882, A101930, A366428, A380072, A386307, A386944, A386945.

Programs

  • Maple
    A386943:=proc(N) # To get all hypotenuses <= N
    local i,l,u,v;
    l:=[];
    for u from 2 to floor(sqrt(N-1)) do
        for v to min(u-1,floor(sqrt(N-u^2))) do
            if gcd(u,v)>1 or is(u-v,even) then
                l:=[op(l),[u^2+v^2,max(2*u*v,u^2-v^2),min(2*u*v,u^2-v^2)]]
            fi
        od
    od;
    l:=sort(l);
    return seq(l[i,1],i=1..nops(l));
end proc;
A386943(296);

Formula

a(n) = sqrt(A386944(n)^2 + A386945(n)^2).
{A009000(n)} = {a(n)} union {A020882(n)} union {A386307(n)}.
Showing 1-3 of 3 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.