A198386 -id:A198386 - cp's OEIS frontend

A198409 Positions in sequences A198384, A198385 and A198386 to indicate triples of squares in arithmetic progression, that are not multiples of earlier triples.

1, 3, 5, 7, 10, 13, 15, 23, 24, 26, 30, 35, 39, 42, 45, 47, 51, 54, 62, 69, 70, 72, 83, 84, 88, 97, 98, 102, 107, 114, 115, 124, 126, 129, 136, 141, 142, 143, 156, 157, 167, 169, 172, 177, 181, 188, 191, 201, 205, 208, 214, 218, 229, 230, 237, 244, 249, 253

Offset: 1

Reinhard Zumkeller, Oct 25 2011

nonn

A198435(n) = A198384(a(n)); A198439(n) = A198388(a(n));
A198436(n) = A198385(a(n)); A198440(n) = A198389(a(n));
A198437(n) = A198386(a(n)); A198441(n) = A198390(a(n));
A198438(n) = A198387(a(n)).

Ray Chandler, Table of n, a(n) for n = 1..10000
Reinhard Zumkeller, Table of initial values

import Data.List (elemIndices)
a198409 n = a198409_list !! (n-1)
a198409_list = map (+ 1) $ elemIndices 1 $ map a008966 $
   zipWith gcd a198384_list $ zipWith gcd a198385_list a198386_list

wmax = 1000;
triples[w_] := Reap[Module[{u, v}, For[u = 1, u < w, u++, If[IntegerQ[v = Sqrt[(u^2 + w^2)/2]], Sow[{u^2, v^2, w^2}]]]]][[2]];
tt = Flatten[DeleteCases[triples /@ Range[wmax], {}], 2];
Position[tt, t_List /; SquareFreeQ[GCD@@t]] // Flatten (* Jean-François Alcover, Oct 24 2021 *)

A008966(A050873(A198439(n),A050873(A198440(n),A050873(A198441(n))))) = 1.

A198441 Square root of third term of a triple of squares in arithmetic progression that is not a multiple of another triple in (A198384, A198385, A198386).

Original entry on oeis.org

7, 17, 23, 31, 41, 47, 49, 71, 73, 79, 89, 97, 103, 113, 119, 119, 127, 137, 151, 161, 161, 167, 191, 193, 199, 217, 217, 223, 233, 239, 241, 257, 263, 271, 281, 287, 287, 289, 311, 313, 329, 329, 337, 343, 353, 359, 367, 383, 391, 391, 401, 409, 431, 433

Offset: 1

Reinhard Zumkeller, Oct 25 2011

nonn

This sequence gives the sum of the two legs (catheti) x + y of primitive Pythagorean triangles (x,y,z) with y even and gcd(x,y) = 1, ordered nondecreasingly (with multiple entries). See A058529(n), n>=2, for the sequence without multiple entries. For the proof, put in the Zumkeller link w = x + y, v = z and u = abs(x - y). This works because w^2 - v^2 = v^2 - u^2, hence u^2 = 2*v^2 - w^2 = 2*z^2 - (x+y)^2 = 2*(x^2 + y^2) - (x+y)^2 = x^2 + y^2 - 2*x*y = (x-y)^2. The primitivity of the arithmetic progression triples follows from the one of the Pythagorean triples: gcd(u,w) = 1 follows from gcd(x,y) = 1, then gcd(u,v,w) = gcd(gcd(u,w),v) = 1. The converse can also be proved: given a primitive arithmetic progression triple (u,v,w), 1 <= u < v < w, gcd(u,v,w) = 1, the corresponding primitive Pythagorean triple with even y is ((w-u)/2,(w+u)/2,v) or ((w+u)/2,(w-u)/2,v), depending on whether (w+u)/2 is even or odd, respectively. - Wolfdieter Lang, May 22 2013

n appears A330174(n) times. - Ray Chandler, Feb 26 2020

			Primitive Pythagorean triangle connection: a(1) = 7 because (u,v,w) = (1,5,7) corresponds to the primitive Pythagorean triangle (x = (w-u)/2, y = (w+u)/2, z = v) = (3,4,5) with leg sum 3 + 4 = 7. - _Wolfdieter Lang_, May 23 2013

Ray Chandler, Table of n, a(n) for n = 1..10000
Keith Conrad, Arithmetic progressions of three squares
Reinhard Zumkeller, Table of initial values

Cf. A225949 (triangle version of leg sums).
Cf. A198384, A198385, A198386.
Cf. A058529, A198390, A198409, A198437, A330174.

a198441 n = a198441_list !! (n-1)
a198441_list = map a198390 a198409_list

wmax = 1000;
triples[w_] := Reap[Module[{u, v}, For[u = 1, u < w, u++, If[IntegerQ[v = Sqrt[(u^2 + w^2)/2]], Sow[{u, v, w}]]]]][[2]];
tt = Flatten[DeleteCases[triples /@ Range[wmax], {}], 2];
DeleteCases[tt, t_List /; GCD@@t > 1 && MemberQ[tt, t/GCD@@t]][[All, 3]] (* Jean-François Alcover, Oct 22 2021 *)

A198437(n) = a(n)^2; a(n) = A198390(A198409(n)).

A198435 First term of a triple of squares in arithmetic progression, which is not a multiple of another triple in (A198384,A198385,A198386).

Original entry on oeis.org

1, 49, 49, 289, 1, 529, 961, 2401, 289, 2209, 529, 5041, 49, 1681, 1681, 6241, 9409, 49, 961, 5329, 16129, 14161, 7921, 289, 25921, 2209, 12769, 27889, 14161, 1, 39601, 2401, 5329, 10609, 25921, 49729, 58081, 529, 961, 10609, 7921, 36481, 82369, 22801, 47089

Offset: 1

Reinhard Zumkeller, Oct 25 2011

nonn

Ray Chandler, Table of n, a(n) for n = 1..10000
Keith Conrad, Arithmetic progressions of three squares
Reinhard Zumkeller, Table of initial values

Cf. A198384, A198409, A198437, A198438, A198439

a198435 n = a198435_list !! (n-1)
a198435_list = map a198384 a198409_list

wmax = 1000;
triples[w_] := Reap[Module[{u, v}, For[u = 1, u < w, u++, If[IntegerQ[v = Sqrt[(u^2 + w^2)/2]], Sow[{u^2, v^2, w^2}]]]]][[2]];
tt = Flatten[DeleteCases[triples /@ Range[wmax], {}], 2];
DeleteCases[tt, t_List /; GCD @@ t>1 && MemberQ[tt, t/GCD @@ t]][[All, 1]] (* Jean-François Alcover, Oct 20 2021 *)

a(n) = A198439(n)^2 = A198384(A198409(n));

A198436(n) - a(n) = A198437(n) - A198436(n) = A198438(n).

A198436 Second term of a triple of squares in arithmetic progression, which is not a multiple of another triple in (A198384, A198385, A198386).

Original entry on oeis.org

25, 169, 289, 625, 841, 1369, 1681, 3721, 2809, 4225, 4225, 7225, 5329, 7225, 7921, 10201, 12769, 9409, 11881, 15625, 21025, 21025, 22201, 18769, 32761, 24649, 29929, 38809, 34225, 28561, 48841, 34225, 37249, 42025, 52441, 66049, 70225, 42025, 48841, 54289

Offset: 1

Reinhard Zumkeller, Oct 25 2011

nonn

Ray Chandler, Table of n, a(n) for n = 1..10000
Keith Conrad, Arithmetic progressions of three squares
Reinhard Zumkeller, Table of initial values

Cf. A198385, A198409, A198435, A198437, A198438, A198440.

a198436 n = a198436_list !! (n-1)
a198436_list = map a198385 a198409_list

wmax = 1000;
triples[w_] := Reap[Module[{u, v}, For[u = 1, u < w, u++, If[IntegerQ[v = Sqrt[(u^2 + w^2)/2]], Sow[{u^2, v^2, w^2}]]]]][[2]];
tt = Flatten[DeleteCases[triples /@ Range[wmax], {}], 2];
DeleteCases[tt, t_List /; GCD @@ t>1 && MemberQ[tt, t/GCD @@ t]][[All, 2]] (* Jean-François Alcover, Oct 20 2021 *)

a(n) = A198440(n)^2 = A198385(A198409(n)).

a(n) - A198435(n) = A198437(n) - a(n) = A198438(n).

A198437 Third term of a triple of squares in arithmetic progression, which is not a multiple of another triple in (A198384,A198385,A198386).

Original entry on oeis.org

49, 289, 529, 961, 1681, 2209, 2401, 5041, 5329, 6241, 7921, 9409, 10609, 12769, 14161, 14161, 16129, 18769, 22801, 25921, 25921, 27889, 36481, 37249, 39601, 47089, 47089, 49729, 54289, 57121, 58081, 66049, 69169, 73441, 78961, 82369, 82369, 83521, 96721

Offset: 1

Reinhard Zumkeller, Oct 25 2011

nonn

Ray Chandler, Table of n, a(n) for n = 1..10000
Keith Conrad, Arithmetic progressions of three squares
Reinhard Zumkeller, Table of initial values

Cf. A198435, A198436, A198438, A198409, A198441.

a198437 n = a198437_list !! (n-1)
a198437_list = map a198386 a198409_list

wmax = 1000;
triples[w_] := Reap[Module[{u, v}, For[u = 1, u < w, u++, If[IntegerQ[v = Sqrt[(u^2 + w^2)/2]], Sow[{u^2, v^2, w^2}]]]]][[2]];
tt = Flatten[DeleteCases[triples /@ Range[wmax], {}], 2];
DeleteCases[tt, t_List /; GCD @@ t>1 && MemberQ[tt, t/GCD @@ t]][[All, 3]] (* Jean-François Alcover, Oct 20 2021 *)

a(n) = A198441(n)^2 = A198386(A198409(n));

a(n) - A198436(n) = A198436(n) - A198435(n) = A198438(n).

A198438 Common differences in triples of squares in arithmetic progression, that are not a multiples of other triples in (A198384, A198385, A198386).

Original entry on oeis.org

24, 120, 240, 336, 840, 840, 720, 1320, 2520, 2016, 3696, 2184, 5280, 5544, 6240, 3960, 3360, 9360, 10920, 10296, 4896, 6864, 14280, 18480, 6840, 22440, 17160, 10920, 20064, 28560, 9240, 31824, 31920, 31416, 26520, 16320, 12144, 41496, 47880, 43680, 50160

Offset: 1

Reinhard Zumkeller, Oct 25 2011

nonn

Ray Chandler, Table of n, a(n) for n = 1..10000
Keith Conrad, Arithmetic progressions of three squares
Reinhard Zumkeller, Table of initial values

a198438 n = a198438_list !! (n-1)
a198438_list = map a198387 a198409_list

wmax = 1000;
triples[w_] := Reap[Module[{u, v}, For[u = 1, u < w, u++, If[IntegerQ[v = Sqrt[(u^2 + w^2)/2]], Sow[{u^2, v^2, w^2}]]]]][[2]];
tt = Flatten[DeleteCases[triples /@ Range[wmax], {}], 2];
#[[2]] - #[[1]]& /@ DeleteCases[tt, t_List /; GCD@@t > 1 && MemberQ[tt, t/GCD@@t]] (* Jean-François Alcover, Oct 22 2021 *)

a(n) = A198387(A198409(n)) = A198436(n) - A198435(n) = A198437(n) - A198436(n).

A198439 Square root of first term of a triple of squares in arithmetic progression that is not a multiple of another triple in (A198384, A198385, A198386).

Original entry on oeis.org

1, 7, 7, 17, 1, 23, 31, 49, 17, 47, 23, 71, 7, 41, 41, 79, 97, 7, 31, 73, 127, 119, 89, 17, 161, 47, 113, 167, 119, 1, 199, 49, 73, 103, 161, 223, 241, 23, 31, 103, 89, 191, 287, 151, 217, 287, 137, 233, 71, 337, 79, 137, 17, 281, 359, 391, 49, 113, 119, 217

Offset: 1

Reinhard Zumkeller, Oct 25 2011

nonn

This sequence gives the values |x-y| of primitive Pythagorean triangles (x,y,z) with even y ordered according to the nondecreasing values of the leg sums x+y (called w in the Zumkeller link, and given in A198441). For the equivalence to primitive Pythagorean triples with even y see a comment in A198441. - Wolfdieter Lang, May 22 2013

			From _Wolfdieter Lang_, May 22 2013: (Start)
Primitive Pythagorean triple (x,y,z), y even, connection:
a(2) = 7 because the triple with second smallest leg sum x+y = 17 = A198441(2) is (5,12,13), and |x - y| = y - x = 12 - 5 = 7.
a(3) = 7 because x + y = A198441(3) = 23, (x,y,z) = (15,8,17) (the primitive triple with third smallest leg sum), and |x-y| = x - y = 15 - 8 = 7. (End)

Ray Chandler, Table of n, a(n) for n = 1..10000
Keith Conrad, Arithmetic progressions of three squares
Reinhard Zumkeller, Table of initial values

a198439 n = a198439_list !! (n-1)
a198439_list = map a198388 a198409_list

wmax = 1000;
triples[w_] := Reap[Module[{u, v}, For[u = 1, u < w, u++, If[IntegerQ[v = Sqrt[(u^2 + w^2)/2]], Sow[{u, v, w}]]]]][[2]];
tt = Flatten[DeleteCases[triples /@ Range[wmax], {}], 2];
DeleteCases[tt, t_List /; GCD@@t>1 && MemberQ[tt, t/GCD@@t]][[All, 1]] (* Jean-François Alcover, Oct 22 2021 *)

A198435(n) = a(n)^2; a(n) = A198388(A198409(n)).

A198440 Square root of second term of a triple of squares in arithmetic progression that is not a multiple of another triple in (A198384, A198385, A198386).

Original entry on oeis.org

5, 13, 17, 25, 29, 37, 41, 61, 53, 65, 65, 85, 73, 85, 89, 101, 113, 97, 109, 125, 145, 145, 149, 137, 181, 157, 173, 197, 185, 169, 221, 185, 193, 205, 229, 257, 265, 205, 221, 233, 241, 269, 313, 265, 293, 325, 277, 317, 281, 365, 289, 305, 305, 365, 401

Offset: 1

Reinhard Zumkeller, Oct 25 2011

nonn

This sequence gives the hypotenuses of primitive Pythagorean triangles (with multiplicities) ordered according to nondecreasing values of the leg sums x+y (called w in the Zumkeller link, given by A198441). See the comment on the equivalence to primitive Pythagorean triangles in A198441. For the values of these hypotenuses ordered nondecreasingly see A020882. See also the triangle version A222946. - Wolfdieter Lang, May 23 2013

			From _Wolfdieter Lang_, May 22 2013: (Start)
Primitive Pythagorean triangle (x,y,z), even y, connection:
a(8) = 61 because the leg sum x+y = A198441(8) = 71 and due to A198439(8) = 49 one has y = (71+49)/2 = 60 is even, hence x = (71-49)/2 = 11 and z = sqrt(11^2 + 60^2) = 61. (End)

Ray Chandler, Table of n, a(n) for n = 1..10000
Keith Conrad, Arithmetic progressions of three squares
Reinhard Zumkeller, Table of initial values

Cf. A020882, A222946.

a198440 n = a198440_list !! (n-1)
a198440_list = map a198389 a198409_list

wmax = 1000;
triples[w_] := Reap[Module[{u, v}, For[u = 1, u < w, u++, If[IntegerQ[v = Sqrt[(u^2 + w^2)/2]], Sow[{u, v, w}]]]]][[2]];
tt = Flatten[DeleteCases[triples /@ Range[wmax], {}], 2];
DeleteCases[tt, t_List /; GCD@@t > 1 && MemberQ[tt, t/GCD@@t]][[All, 2]] (* Jean-François Alcover, Oct 22 2021 *)

A198436(n) = a(n)^2; a(n) = A198389(A198409(n)).

A198385 Second of a triple of squares in arithmetic progression.

Original entry on oeis.org

25, 100, 169, 225, 289, 400, 625, 676, 625, 841, 900, 1156, 1369, 1225, 1681, 1521, 1600, 2500, 2025, 2704, 2601, 2500, 3721, 2809, 3025, 4225, 3364, 3600, 4225, 4225, 4225, 4624, 5625, 5476, 7225, 4900, 6724, 6084, 5329, 5625, 6400, 7225, 7225, 7225, 7921

Offset: 1

Reinhard Zumkeller, Oct 24 2011

nonn

Ray Chandler, Table of n, a(n) for n = 1..10000
Keith Conrad, Arithmetic progressions of three squares
Reinhard Zumkeller, Table of initial values

a198385 n = a198385_list !! (n-1)
a198385_list = map (^ 2) a198389_list

wmax = 1000;
triples[w_] := Reap[Module[{u, v}, For[u = 1, u < w, u++, If[IntegerQ[v = Sqrt[(u^2 + w^2)/2]], Sow[{u^2, v^2, w^2}]]]]][[2]];
Flatten[DeleteCases[triples /@ Range[wmax], {}], 2][[All, 2]] (* Jean-François Alcover, Oct 19 2021 *)

a(n) = A198389(n)^2.
a(n) - A198384(n) = A198386(n) - a(n) = A198387(n).
A198436(n) = a(A198409(n)).

A198384 First of a triple of squares in arithmetic progression.

Original entry on oeis.org

1, 4, 49, 9, 49, 16, 289, 196, 25, 1, 36, 196, 529, 49, 961, 441, 64, 1156, 81, 784, 441, 100, 2401, 289, 121, 2209, 4, 144, 1225, 529, 169, 784, 2601, 2116, 5041, 196, 3844, 1764, 49, 225, 256, 1681, 1225, 289, 1681, 2401, 6241, 9, 4624, 324, 9409, 361

Offset: 1

Reinhard Zumkeller, Oct 24 2011

nonn

Ray Chandler, Table of n, a(n) for n = 1..10000
Keith Conrad, Arithmetic progressions of three squares
Reinhard Zumkeller, Table of initial values

a198384 n = a198384_list !! (n-1)
a198384_list = map (^ 2) a198388_list

wmax = 1000;
triples[w_] := Reap[Module[{u, v}, For[u = 1, u < w, u++, If[IntegerQ[v = Sqrt[(u^2 + w^2)/2]], Sow[{u^2, v^2, w^2}]]]]][[2]];
Flatten[DeleteCases[triples /@ Range[wmax], {}], 2][[All, 1]] (* Jean-François Alcover, Oct 19 2021 *)

a(n) = A198388(n)^2.
A198385(n) - a(n) = A198386(n) - A198385(n) = A198387(n).
A198435(n) = a(A198409(n)).

Thanks to Benoit Jubin, who had the idea for sequences A198384 .. A198390 and A198435 .. A198441.

cp's OEIS Frontend

A198409 Positions in sequences A198384, A198385 and A198386 to indicate triples of squares in arithmetic progression, that are not multiples of earlier triples.

Views

Author

Keywords

Comments

Links

Programs

Haskell

Mathematica

Formula

A198441 Square root of third term of a triple of squares in arithmetic progression that is not a multiple of another triple in (A198384, A198385, A198386).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A198435 First term of a triple of squares in arithmetic progression, which is not a multiple of another triple in (A198384,A198385,A198386).

Views

Author

Keywords

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A198436 Second term of a triple of squares in arithmetic progression, which is not a multiple of another triple in (A198384, A198385, A198386).

Views

Author

Keywords

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A198437 Third term of a triple of squares in arithmetic progression, which is not a multiple of another triple in (A198384,A198385,A198386).

Views

Author

Keywords

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A198438 Common differences in triples of squares in arithmetic progression, that are not a multiples of other triples in (A198384, A198385, A198386).

Views

Author

Keywords

Links

Programs

Haskell

Mathematica

Formula

A198439 Square root of first term of a triple of squares in arithmetic progression that is not a multiple of another triple in (A198384, A198385, A198386).

Views

Author

Keywords

Comments

Examples

Links

Programs

Haskell

Mathematica

Formula

A198440 Square root of second term of a triple of squares in arithmetic progression that is not a multiple of another triple in (A198384, A198385, A198386).

Views

Author

Keywords

Comments

Examples

Links