login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A276808 Odd prime numbers p such that p*Bernoulli(p-1) + (p-1)!*(p-1) == 0 (mod p^3). 0

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 10:53 EDT 2024. Contains 371936 sequences. (Running on oeis4.)