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 A276808 #16 Oct 02 2016 00:49:48
%S A276808 17,1733,18433
%N A276808 Odd prime numbers p such that p*Bernoulli(p-1) + (p-1)!*(p-1) == 0 (mod p^3).
%C A276808 For all other odd primes, the congruence holds mod p^2 only.
%o A276808 (PARI) lista(nn) = {forprime(p=3, nn, if (!((p*bernfrac(p-1) + (p-1)!*(p-1)) % p^3) , print1(p, ", ")););} \\ _Michel Marcus_, Sep 18 2016
%Y A276808 Cf. A088164, A197632.
%K A276808 nonn,hard,more
%O A276808 1,1
%A A276808 _René Gy_, Sep 18 2016