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”).
%I #28 Feb 26 2019 05:06:30
%S 24,96,120,216,240,336,384,480,600,720,840,864,960,1080,1176,1320,
%T 1344,1536,1920,1944,2016,2160,2184,2400,2520,2880,2904,3000,3024,
%U 3360,3456,3696,3840,3960,4056,4320,4704,4896,5280,5376,5400,5544
%N Congrua (possible solutions to the congruum problem): numbers n such that there are integers x, y and z with n = x^2-y^2 = z^2-x^2.
%C n is a "congruum" iff n/4 is the area of a Pythagorean triangle, so these are the numbers 4*A009112.
%C Each congruum is a multiple of 24; it cannot be a square.
%H Robert Israel, <a href="/A256418/b256418.txt">Table of n, a(n) for n = 1..10000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Congruum.html">Congruum</a> (but beware errors)
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Congruum">Congruum</a> (but beware errors).
%e a(11)=840 since 840=29^2-1^2=41^2-29^2 (indeed also 840=37^2-23^2=47^2-37^2).
%t r[n_] := Reduce[0 < y < x && 0 < x < z && n == x^2 - y^2 == z^2 - x^2, {x, y, z}, Integers];
%t Reap[For[n = 24, n < 10^4, n += 24, rn = r[n]; If[rn =!= False, Print[n, " ", rn]; Sow[n]]]][[2, 1]] (* _Jean-François Alcover_, Feb 25 2019 *)
%Y Cf. A004431 for possible values of x in definition. Cf. A057103, A055096 for triangles of all congrua and values of x.
%Y Cf. A009112, A073120, A135789, A135786.
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Apr 06 2015, following a suggestion from _Robert Israel_, Apr 03. 2015. This entry incorporates many comments that were originally in A057102. A057103 and A055096 need to be checked.