cp's OEIS Frontend

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.

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

Original entry on oeis.org

17, 1733, 18433
Offset: 1

Views

Author

René Gy, Sep 18 2016

Keywords

Comments

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

Crossrefs

Programs

  • 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