|
Search: id:A078644
|
|
| |
|
| 1, 2, 3, 3, 3, 6, 3, 4, 5, 6, 3, 9, 3, 6, 9, 5, 3, 10, 3, 9, 9, 6, 3, 12, 5, 6, 7, 9, 3, 18, 3, 6, 9, 6, 9, 15, 3, 6, 9, 12, 3, 18, 3, 9, 15, 6, 3, 15, 5, 10, 9, 9, 3, 14, 9, 12, 9, 6, 3, 27, 3, 6, 15, 7, 9, 18, 3, 9, 9, 18, 3, 20, 3, 6, 15, 9, 9, 18, 3, 15, 9, 6, 3, 27, 9, 6, 9, 12, 3, 30, 9, 9, 9, 6, 9
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Inverse Moebius transform of A068068. Number of elements in the set {(x,y): x is odd, x|n, y|n, gcd(x,y)=1}.
The number of Pythagorean points (x,y), 0<x<y, located on the hyperbola y=2n(x-n)/(x-2n) and having "excess" x+y-z = 2n. - Seppo Mustonen (seppo.mustonen(AT)helsinki.fi), Jun 07 2005
a(n) is the number of Pythagorean triangles with radius of the inscribed circle equal to n. - Ant King, mathstutoring(AT)ntlworld.com, Mar 06 2006. For number of primitive Pythagorean triangles having inradius n, see A068068(n).
|
|
LINKS
|
S. Mustonen, Visualization and characterization of Pythagorean triples
|
|
FORMULA
|
Multiplicative with a(2^e) = e+1, a(p^e) = 2*e+1, p>2. a(n) = tau(n^2) if n is odd, a(n) = tau(n^2)-a(n/2) if n is even.
|
|
CROSSREFS
|
Cf. A000005, A048691.
Sequence in context: A126868 A119688 A134187 this_sequence A133700 A087688 A126854
Adjacent sequences: A078641 A078642 A078643 this_sequence A078645 A078646 A078647
|
|
KEYWORD
|
mult,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Dec 13 2002
|
|
|
Search completed in 0.002 seconds
|
