login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A198388
Square root of first term of a triple of squares in arithmetic progression.
5
1, 2, 7, 3, 7, 4, 17, 14, 5, 1, 6, 14, 23, 7, 31, 21, 8, 34, 9, 28, 21, 10, 49, 17, 11, 47, 2, 12, 35, 23, 13, 28, 51, 46, 71, 14, 62, 42, 7, 15, 16, 41, 35, 17, 41, 49, 79, 3, 68, 18, 97, 19, 56, 7, 42, 20, 69, 98, 34, 21, 93, 31, 63, 22, 85, 94, 23, 49, 73
OFFSET
1,2
COMMENTS
There is a connection to |x-y| of Pythagorean triangles (x,y,z). See a comment on the primitive Pythagorean triangle case under A198441 which applies mutatis mutandis. - Wolfdieter Lang, May 23 2013
FORMULA
A198384(n) = a(n)^2.
A198439(n) = a(A198409(n)).
EXAMPLE
Connection to Pythagorean triangles: a(2) = 2 because (in the notation of the Zumkeller link) (u,v,w) = 2*(1,5,7) and the corresponding Pythagorean triangle is 2*((7-1)/2,(1+7)/2,5) = 2*(3,4,5) with |x-y| = 2*(4-3) = 2. - Wolfdieter Lang, May 23 2013
MATHEMATICA
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, 1]] (* Jean-François Alcover, Oct 20 2021 *)
PROG
(Haskell)
a198388 n = a198388_list !! (n-1)
a198388_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]
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Oct 24 2011
STATUS
approved