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 A259230 #13 Dec 06 2015 11:35:35
%S A259230 1,6,1,24,64,1,384
%N A259230 a(n) = smallest k such that (A115091(n)-k)! == -1 (mod A115091(n)^2).
%C A259230 The values of m in A115091.
%C A259230 A115091(n) is in A007540 iff a(n) = 1.
%e A259230 a(2) = 6, because 6 is the smallest k such that (A115091(2)-k)! == -1 (mod A115091(2)^2), which yields the congruence (11-6)! == -1 (mod 11^2).
%t A259230 t = Select[Prime@ Range@ 120, AnyTrue[Range@ #, Function[m, Divisible[m! + 1, #^2]]] &]; Table[k = 1; While[Mod[(t[[n]] - k)!, t[[n]]^2] != t[[n]]^2 - 1, k++]; k, {n, 7}] (* _Michael De Vlieger_, Nov 10 2015, Version 10 *)
%o A259230 (PARI) forprime(p=1, , for(k=1, p-1, if(Mod((p-k)!, p^2)==-1, print1(k, ", "); break({1}))))
%Y A259230 Cf. A007540, A115091.
%K A259230 nonn,hard,more
%O A259230 1,2
%A A259230 _Felix Fröhlich_, Nov 08 2015