OFFSET
2,2
COMMENTS
Conjecture: 2*a(n) is always a quadratic residue mod p_n.
Zhi-Wei Sun also made the following general conjecture:
Let p be any odd prime. For each integer d let T(d,p) be the determinant of the (p+1)/2 X (p+1)/2 matrix whose (i,j)-entry (i,j=0,...,(p-1)/2) is the Legendre symbol ((i^2+d*j^2)/p). Then T(-d,p) == (2/p)*T(d,p) (mod p). If d is a quadratic residue mod p, then so is 2*T(d,p). If d is a quadratic non-residue mod p, then T(d,p) is a quadratic residue mod p.
The author has proved the following results for any odd prime p:
(1) If c and d are integers with c not divisible by p, and d' == c^2*d (mod p), then T(d',p) = (c/p)^((p+1)/2)*T(d,p).
(2) If p is congruent to 1 mod 4 and d is not divisible by p, then T(-d,p) = (2/p)*T(d,p).
The general conjecture mentioned above was proved in a recent preprint of Zhi-Wei Sun.
LINKS
Zhi-Wei Sun, Table of n, a(n) for n = 2..70
Zhi-Wei Sun, On some determinants with Legendre symbol entries, preprint, arXiv:1308.2900 [math.NT], 2013-2019.
EXAMPLE
a(2) = -1 since the determinant |((i^2 + j^2)/3)|_{i=0,1; j=0,1} equals -1.
MATHEMATICA
a[n_] := Det[Table[JacobiSymbol[i^2+j^2, Prime[n]], {i, 0, (Prime[n]-1)/2}, {j, 0, (Prime[n]-1)/2}]]; Table[a[n], {n, 2, 20}]
PROG
(PARI) a(n) = my(p=prime(n)); matdet(matrix((p+1)/2, (p+1)/2, i, j, i--; j--; kronecker(i^2+j^2, p))); \\ Michel Marcus, Aug 25 2021
CROSSREFS
KEYWORD
sign
AUTHOR
Zhi-Wei Sun, Aug 01 2013
STATUS
approved