|
| |
|
|
A072069
|
|
Number of integer solutions to the equation 2x^2+y^2+32z^2=m for an odd number m=2n-1.
|
|
7
| |
|
|
2, 4, 0, 0, 6, 4, 0, 0, 4, 4, 0, 0, 2, 8, 0, 0, 12, 8, 0, 0, 16, 12, 0, 0, 10, 16, 0, 0, 12, 20, 0, 0, 16, 4, 0, 0, 12, 12, 0, 0, 14, 20, 0, 0, 20, 8, 0, 0, 4, 20, 0, 0, 8, 12, 0, 0, 24, 8, 0, 0, 14, 8, 0, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Related to primitive congruent numbers A006991.
Assuming the Birch and Swinnerton-Dyer conjecture, the odd number 2n-1 is a congruent number if it is squarefree and 2 a(n) = A072068(n).
|
|
|
REFERENCES
| J. B. Tunnell, A classical Diophantine problem and modular forms of weight 3/2, Invent. Math., 72 (1983), 323-334.
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..10000
Clay Mathematics Institute, The Birch and Swinnerton-Dyer Conjecture
Department of Pure Maths., Univ. Sheffield, Pythagorean triples and the congruent number problem
Karl Rubin, Elliptic curves and right triangles
|
|
|
EXAMPLE
| a(2) = 4 because (1,1,0), (-1,1,0), (1,-1,0) and (-1,-1,0) are solutions when m=3.
|
|
|
MATHEMATICA
| maxN=128; soln2=Table[0, {maxN/2}]; xMax=Ceiling[Sqrt[maxN/2]]; yMax=Ceiling[Sqrt[maxN]]; zMax=Ceiling[Sqrt[maxN/32]]; Do[n=2x^2+y^2+32z^2; If[OddQ[n]&&n<maxN, s=8; If[x==0, s=s/2]; If[y==0, s=s/2]; If[z==0, s=s/2]; soln2[[(n+1)/2]]+=s], {x, 0, xMax}, {y, 0, yMax}, {z, 0, zMax}]
|
|
|
CROSSREFS
| Cf. A006991, A003273, A072068, A072070, A072071.
Sequence in context: A107501 A126732 A028586 * A004025 A102561 A072068
Adjacent sequences: A072066 A072067 A072068 * A072070 A072071 A072072
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| T. D. Noe (noe(AT)sspectra.com), Jun 13 2002
|
| |
|
|
