|
Search: id:A088197
|
|
| |
|
| 1, 3, 4, 1, 3, 4, 4, 5, 3, 5, 3, 4, 4, 5, 7, 1, 7, 4, -2, 10, 4, 4, 6, 7, 3, 4, 1, 3, 16, 4, 4, 4, 9, 3, 5, 7, 4, 5, 7, 1, 11, -2, 7, 3, 12, 12, 4, 1, 3, 8, -4, 16, 4, 8, 5, 3, 5, 3, 4, 9, 15, 4, -2, 7, 15, 2, 14, 1, 3, 8, 8, 5, 7, 4, 5, 8, 3, 4, 16, 1, 11, -2, 10, 4, 4, 6, 7, 3, 4, 12, 8, 4, 8, 4, 5, 11, 4, 17
(list; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
PROGRAM
|
(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
|
Cf. A088191, A088196, A088198, A088199, A088200, A088201.
Sequence in context: A090279 A101667 A117378 this_sequence A087517 A128529 A131228
Adjacent sequences: A088194 A088195 A088196 this_sequence A088198 A088199 A088200
|
|
KEYWORD
|
easy,sign
|
|
AUTHOR
|
Ferenc Adorjan (fadorjan(AT)freemail.hu), Sep 23 2003
|
|
|
Search completed in 0.002 seconds
|