OFFSET
2,2
PROG
(PARI) qnrp_d(n)= { /* The difference sequence of the sequence with the largest QnR modulo the primes */ local(k=1, m, p, fl, jj, j, v=[]); for(i=3, n, m=0; p=prime(i); jj=0; fl=2^p-1; j=2; while((j<=(p-1)/2), jj=(j^2)%p; fl-=2^jj; j++); j=p-1; while(m==0, if(bitand(2^j, fl), m=j); j--); v=concat(v, m-k); k=m); print(v)}
CROSSREFS
KEYWORD
easy,sign
AUTHOR
Ferenc Adorjan (fadorjan(AT)freemail.hu), Sep 23 2003
STATUS
approved