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 A115091 #11 Jan 30 2016 04:47:14
%S A115091 5,11,13,47,71,563,613
%N A115091 Primes p such that p^2 divides m!+1 for some integer m<p.
%C A115091 By Wilson's theorem, we know that there is an m=p-1 such that p divides m!+1. Sequence A115092 gives the number of m for each prime. Occasionally p^2 also divides m!+1. These primes seem to be only slightly more plentiful than Wilson primes (A007540). No other primes < 10^6.
%C A115091 There is no prime p < 10^8 such that p^2 divides m!+1 for some m <= 1200. [From F. Brunault (brunault(AT)gmail.com), Nov 23 2008]
%C A115091 For a(n), m = p-A259230(n). - _Felix Fröhlich_, Jan 24 2016
%D A115091 R. K. Guy, Unsolved Problems in Number Theory, 3rd Ed., New York, Springer-Verlag, 2004, Section A2.
%t A115091 nn=1000; lst={}; Do[p=Prime[i]; p2=p^2; f=1; m=1; While[m<p && f+1<p2, m++; f=Mod[f*m,p2]]; If[m<p, AppendTo[lst,p]], {i,PrimePi[nn]}]; lst
%t A115091 Select[Prime@ Range@ 1000, Function[p, AnyTrue[Range[p - 1], Divisible[#! + 1, p^2] &]]] (* _Michael De Vlieger_, Jan 24 2016, Version 10 *)
%o A115091 (PARI) forprime(p=1, , for(k=1, p-1, if(Mod((p-k)!, p^2)==-1, print1(p, ", "); break({1})))) \\ _Felix Fröhlich_, Jan 24 2016
%Y A115091 Cf. A064237 (n!+1 is divisible by a square), A259230.
%K A115091 hard,more,nonn
%O A115091 1,1
%A A115091 _T. D. Noe_, Mar 01 2006