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 A225083 #13 Mar 18 2014 03:54:56 %S A225083 2,3,5,7,11,13,17,19,31,37,41,43,47,53,73,89,97,101,103,107,113,127, %T A225083 131,151,157,163,167,173,179,181,191,197,199,211,223,229,241,263,281, %U A225083 283,313,331,337,347,349,353,367,373,409,421,433,439,443,457,487,491,509,523,541,547,587,617 %N A225083 Non-Pillai primes: primes p such that for all m such either p is 1 mod m or m!+1 is not 0 mod p. %C A225083 Complement of A063980 in the primes. %C A225083 Sophie Germain primes in this sequence: 2, 5, 11, 41, 53, 89, 113, 131, 173, 179, 191, 281, 443, 491, 509, 641, 653, 659, 743, 761, 911, 1013, 1049, 1103, 1223, 1409, 1439, 1451, 1481, 1583, 1733, 1901, 1931, 1973, 2003,2129, 2141, 2459, 2693, 2741, 2939, 3023, 3299,... %H A225083 Charles R Greathouse IV, <a href="/A225083/b225083.txt">Table of n, a(n) for n = 1..10000</a> %o A225083 (PARI) is(p)=my(t=Mod(5040, p)); for(m=8, p-2, t*=m; if(t==-1 && p%m!=1, return(0))); isprime(p) \\ _Charles R Greathouse IV_, Mar 18 2014 %K A225083 nonn %O A225083 1,1 %A A225083 _Irina Gerasimova_, Apr 27 2013 %E A225083 New name from _Charles R Greathouse IV_, Mar 18 2014