OFFSET
1,1
COMMENTS
"We can also prove (this is more difficult) that for an arbitrary natural number m there exist m Pythagorean triangles the hypotenuses of which are given by successive natural numbers, n, n+1, n+2, ..., n+m-1." Sierpinski (p. 28). No proof is given in book.
REFERENCES
W. Sierpinski, Pythagorean Triangles, Dover Publications, Mineola NY, 2003.
LINKS
EXAMPLE
a(4)=50 since 50, 51, 52 and 53 is the first occurrence of 4 consecutive integers which are lengths of hypotenuses of Pythagorean triangles.
MATHEMATICA
lmt = 5*10^6; hyp = {5}; Do[ mn = m^2 + n^2; hyp = Join[hyp, Table[k*mn, {k, Floor[lmt/mn]}]]; hyp = Union[hyp], {n, 2, 1150}, {m, Min[n - 1, Floor[ Sqrt[ lmt - n^2]]]}]; f[n_] := Block[{k = 1}, While[phk[[k]] + n - 1 != phk[[k + n - 1]], k++ ]; phk[[k]]]; Do[ Print[ f[n]], {n, 33} (* Robert G. Wilson v, Nov 10 2004 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Charlie Marion, Nov 05 2004
EXTENSIONS
More terms from Ray Chandler and Robert G. Wilson v, Nov 10 2004
STATUS
approved