OFFSET
1,1
COMMENTS
Those odd numbers 2n+1 for which the sum of i in [1,2n+1] with J(i,2n+1)=-1 is equal to the sum of i in [1,2n+1] with J(i,2n+1)=+1. Here J(i,k) is the Jacobi symbol.
PROG
(Python)
from sympy import jacobi_symbol as J
def a(n):
l=0
m=0
for i in range(1, 2*n + 2):
if J(i, 2*n + 1)==-1: l+=i
elif J(i, 2*n + 1)==1: m+=i
return l - m
print([2*n + 1 for n in range(201) if a(n)==0]) # Indranil Ghosh, Jun 12 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Oct 21 2009, Oct 22 2009
STATUS
approved