A198440 -id:A198440 - cp's OEIS frontend

A222946 Triangle for hypotenuses of primitive Pythagorean triangles.

5, 0, 13, 17, 0, 25, 0, 29, 0, 41, 37, 0, 0, 0, 61, 0, 53, 0, 65, 0, 85, 65, 0, 73, 0, 89, 0, 113, 0, 85, 0, 97, 0, 0, 0, 145, 101, 0, 109, 0, 0, 0, 149, 0, 181, 0, 125, 0, 137, 0, 157, 0, 185, 0, 221, 145, 0, 0, 0, 169, 0, 193, 0, 0, 0, 265, 0, 173, 0, 185, 0, 205, 0, 233, 0, 269, 0, 313, 197, 0, 205, 0, 221, 0, 0, 0, 277, 0, 317, 0, 365

Offset: 2

Wolfdieter Lang, Mar 21 2013

For primitive Pythagorean triples (x,y,z) see the Niven et al. reference, Theorem 5.5, p. 232, and the Hardy-Wright reference, Theorem 225, p. 190.
Here a(n,m) = 0 for non-primitive Pythagorean triangles.
There is a one-to-one correspondence between the values n and m of this number triangle for which a(n,m) does not vanish and primitive solutions of x^2 + y^2 = z^2 with y even, namely x = n^2 - m^2, y = 2*n*m and z = n^2 + m^2.
The diagonal sequence is given by a(n,n-1) = A001844(n-1), n >= 2.
The row sums of this triangle are 5, 13, 42, 70, 98, 203, 340, 327, 540, ...
a(n,k) = A055096(n-1,k) * ((n+k) mod 2) * A063524 (gcd(n,k)): terms in A055096 that are not hypotenuses in primitive Pythagorean triangles, are replaced by 0. - Reinhard Zumkeller, Mar 23 2013
The number of non-vanishing entries in row n is A055034(n). - Wolfdieter Lang, Mar 24 2013
The non-vanishing entries when ordered according to nondecreasing leg sums x+y (see A225949 and A198441) produce (with multiplicities) A198440. - Wolfdieter Lang, May 22 2013
a(n, m) also gives twice the member s(n, m) of the triple (r(n, m), s(n, m), t(n, m)) with squares r(n, m)^2, s(n, m)^2 and t(n, m)^2 in arithmetic progression with common difference A(n, m) = A249869(n, m), the area of the primitive Pythagorean triangle, or 0 if there is no such triangle. The other members are given by 2*r(n, m) = A278717(n, m) and 2*t(n, m) = A225949(n, m). See A278717 for details and the Keith Conrad reference there. - Wolfdieter Lang, Nov 30 2016

			The triangle a(n,m) begins:
n\m   1   2   3   4   5   6   7   8   9  10  11  12   13 ...
2:    5
3:    0  13
4:   17   0  25
5:    0  29   0  41
6:   37   0   0   0  61
7:    0  53   0  65   0  85
8:   65   0  73   0  89   0 113
9:    0  85   0  97   0   0   0 145
10: 101   0 109   0   0   0 149   0 181
11:   0 125   0 137   0 157   0 185   0 221
12: 145   0   0   0 169   0 193   0   0   0 265
13:   0 173   0 185   0 205   0 233   0 269   0 313
14: 197   0 205   0 221   0   0   0 277   0 317   0  365
...
------------------------------------------------------------
a(7,4) = 7^2 + 4^2 = 49 + 16 = 65.
a(8,1) = 8^2 + 1^2 = 64 +  1 = 65.
a(3,1) = 0 because n and m are both odd.
a(4,2) = 0 because n and m are both even.
a(6,3) = 0 because gcd(6,3) = 3 (not 1).
The primitive triangle for (n,m) = (2,1) is (x,y,z) = (3,4,5).
The primitive triangle for (n,m) = (7,4) is (x,y,z) = (33,56,65).
The primitive triangle for (n,m) = (8,1) is (x,y,z) = (63,16,65).

G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, Fifth Edition, Clarendon Press, Oxford, 2003.
Ivan Niven, Herbert S. Zuckerman and Hugh L. Montgomery, An Introduction to the Theory Of Numbers, Fifth Edition, John Wiley and Sons, Inc., NY 1991.

Reinhard Zumkeller, Rows n = 2..120 of triangle, flattened

Cf. A020882 (ordered nonzero values a(n,m) with multiplicity).

Cf. A249866, A225950 (odd legs), A225951 (perimeters), A225952 (even legs), A225949 (leg sums), A249869 (areas), A258149 (absolute leg differences), A278717 (leg differences).

a222946 n k = a222946_tabl !! (n-2) !! (k-1)
a222946_row n = a222946_tabl !! (n-2)
a222946_tabl = zipWith p [2..] a055096_tabl where
   p x row = zipWith (*) row $
             map (\k -> ((x + k) `mod` 2) * a063524 (gcd x k)) [1..]
-- Reinhard Zumkeller, Mar 23 2013

a(n,m) = n^2 + m^2 if n > m >= 1, gcd(n,m) = 1, and n and m are integers of opposite parity (i.e., (-1)^(n+m) = -1), otherwise a(n,m) = 0.

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

Original entry on oeis.org

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.

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

A198389 Square root of second term of a triple of squares in arithmetic progression.

Original entry on oeis.org

5, 10, 13, 15, 17, 20, 25, 26, 25, 29, 30, 34, 37, 35, 41, 39, 40, 50, 45, 52, 51, 50, 61, 53, 55, 65, 58, 60, 65, 65, 65, 68, 75, 74, 85, 70, 82, 78, 73, 75, 80, 85, 85, 85, 89, 91, 101, 87, 100, 90, 113, 95, 104, 97, 102, 100, 111, 122, 106, 105, 123, 109

Offset: 1

Reinhard Zumkeller, Oct 24 2011

nonn

Apart from its initial 1, A001653 is a subsequence: for all n>1 exists an m such that A198388(m)=1 and a(m)=A001653(n). [observed by Zak Seidov, Reinhard Zumkeller, Oct 25 2011]

There is a connection to hypotenuses of Pythagorean triangles. See a comment for the primitive case on A198441 which applies here mutatis mutandis. - Wolfdieter Lang, May 23 2013

			Connection to Pythagorean triangle hypotenuses: a(20) = 10 because (in the notation of the Zumkeller link) (u,v,w) = 2*(1,5,7) and the Pythagorean triangle is 2*(x=(7-1)/2,y=(1+7)/2,5) = 2*(3,4,5) with hypotenuse 2*5 = 10. - _Wolfdieter Lang_, May 23 2013

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

Cf. A198385, A198409, A198440.

a198389 n = a198389_list !! (n-1)
a198389_list = map (\(,x,) -> x) ts where
   ts = [(u,v,w) | w <- [1..], v <- [1..w-1], u <- [1..v-1],
                   w^2 - v^2 == v^2 - u^2]

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]];
Flatten[DeleteCases[triples /@ Range[wmax], {}], 2][[All, 2]] (* Jean-François Alcover, Oct 20 2021 *)

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

A198440(n) = a(A198409(n)).

cp's OEIS Frontend

A222946 Triangle for hypotenuses of primitive Pythagorean triangles.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Formula

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

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

A198389 Square root of second term of a triple of squares in arithmetic progression.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

Formula