|
Search: id:A008846
|
|
|
| A008846 |
|
Hypotenuses of primitive Pythagorean triangles. |
|
+0
13
|
|
| 5, 13, 17, 25, 29, 37, 41, 53, 61, 65, 73, 85, 89, 97, 101, 109, 113, 125, 137, 145, 149, 157, 169, 173, 181, 185, 193, 197, 205, 221, 229, 233, 241, 257, 265, 269, 277, 281, 289, 293, 305, 313, 317, 325, 337, 349, 353, 365, 373, 377, 389, 397, 401, 409, 421, 425, 433
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Sequence includes all entries of A002144
n for which there is no solution to 4/n = 2/x + 1/y for integers y > x > 0. Related to A073101. - T. D. Noe (noe(AT)sspectra.com), Sep 30 2002
Discovered by Frenicle (on Pythagorean triangles) : Methode pour trouver .. , page 14 on 44. First text of Divers ouvrages .. Par Messieurs de l'Academie Royale des Sciences,in-folio,6+518+1pp,Paris,1693. Also A020882 with only one of doubled terms (first:65). [From Paul Curtz (bpcrtz(AT)free.fr), Sep 03 2008]
|
|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, pp. 10, 107.
|
|
LINKS
|
Ron Knott, Pythagorean Triples and Online Calculators
|
|
FORMULA
|
x^2+y^2 where x is even, y is odd and gcd(x, y)=1. Essentially the same as A004613.
|
|
MAPLE
|
for x from 1 by 2 to 50 do for y from 2 by 2 to 50 do if gcd(x, y) = 1 then print(x^2+y^2); fi; od; od; [ then sort ].
|
|
MATHEMATICA
|
Union[ Map[ Plus@@(#1^2)&, Select[ Flatten[ Array[ {2*#1, 2*#2-1}&, {10, 10} ], 1 ], GCD@@#1 == 1& ] ] ] - Olivier Gerard, Aug 15 1997
|
|
CROSSREFS
|
Cf. A020882, A073101.
Adjacent sequences: A008843 A008844 A008845 this_sequence A008847 A008848 A008849
Sequence in context: A020882 A081804 A004613 this_sequence A120960 A094194 A088511
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
njas, Ralph Peterson (RALPHP(AT)LIBRARY.nrl.navy.mil)
|
|
EXTENSIONS
|
More terms from T. D. Noe (noe(AT)sspectra.com), Sep 30 2002
|
|
|
Search completed in 0.002 seconds
|
