A276808 Odd prime numbers p such that p*Bernoulli(p-1) + (p-1)!*(p-1) == 0 (mod p^3).

17, 1733, 18433

Offset

1,1

Comments

For all other odd primes, the congruence holds mod p^2 only.

Links

Table of n, a(n) for n=1..3.

Prog

(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

Crossrefs

Cf. A088164, A197632.

Sequence in context: A071826 A055414 A156675 * A088465 A001905 A221322

Adjacent sequences: A276805 A276806 A276807 * A276809 A276810 A276811

Keyword

nonn,hard,more

Author

René Gy, Sep 18 2016

Status

approved