|
Search: id:A078926
|
|
|
| A078926 |
|
Number of primitive Pythagorean triangles with perimeter 2n. |
|
+0
5
|
|
| 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
A Pythagorean triangle is a right triangle whose edge lengths are all integers; such a triangle is 'primitive' if the lengths are relatively prime.
Equivalently, number of odd unitary divisors d of n such that sqrt(n) < d < sqrt(2n). (A divisor d of n is 'unitary' if gcd(d,n/d) = 1.) Sketch of proof: A primitive Pythagorean triangle has edge lengths (r^2-s^2, 2rs, r^2+s^2), where 1<=s<r, r and s are relatively prime and r+s is odd. This has perimeter 2n iff n=r(r+s). Let d=r+s.
|
|
EXAMPLE
|
a(858)=2; the primitive Pythagorean triangles with edge lengths (364, 627, 725) and (195, 748, 773) both have perimeter 2*858 = 1716.
|
|
MATHEMATICA
|
oddpart[n_] := If[OddQ[n], n, oddpart[n/2]]; a[n_] := Length[Select[Divisors[oddpart[n]], n<#^2<2n&&GCD[ #, n/# ]==1&]]
|
|
CROSSREFS
|
a(n) = A070109(2n). A078927(n) is smallest s such that a(s)=n. a(n) is nonzero iff n is in A020886.
Sequence in context: A011678 A011679 A011682 this_sequence A025458 A093958 A044936
Adjacent sequences: A078923 A078924 A078925 this_sequence A078927 A078928 A078929
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Dean Hickerson (dean.hickerson(AT)yahoo.com), Dec 15 2002
|
|
|
Search completed in 0.002 seconds
|
