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