This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A088199 #8 Mar 17 2018 04:04:33
%S A088199 73,193,241,313,433,601,1033,1129,1153,1201,1321,1489,1609,1873,2089,
%T A088199 2113,2593,2689,2713,3001,3049,3121,3169,3361,3529,3673,3769,3889,
%U A088199 4129,4273,4729,4801,4969,5233,5281,5449,5521,5569,5641,5689,5881,6361,6553
%N A088199 Primes where the difference sequence (A088197) of LQnR(p_n) (A088196) is <= 0.
%C A088199 The members of the sequence are always == 1 modulo 8 (conjectured!).
%o A088199 (PARI) qnrp_p_nm(n)= {/* The primes where the sequence of the largest QnR modulo the primes is nonmonotonic */ local(k=1,m,p,fl,jj,j,v=[]); for(i=2,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--); if(m-k<=0,v=concat(v,p)); k=m); print(v)}
%Y A088199 Cf. A088193, A088196, A088197, A088198, A088200, A088201.
%K A088199 nonn
%O A088199 1,1
%A A088199 Ferenc Adorjan (fadorjan(AT)freemail.hu), Sep 23 2003