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.

A177771 a(n) = (prime(n) - 1)!.

Original entry on oeis.org

1, 2, 24, 720, 3628800, 479001600, 20922789888000, 6402373705728000, 1124000727777607680000, 304888344611713860501504000000, 265252859812191058636308480000000
Offset: 1

Views

Author

Giovanni Teofilatto, May 13 2010

Keywords

Comments

By Wilson's theorem, a(n) = -1 (mod p) where p is the n-th prime. - Charles R Greathouse IV, Sep 04 2013

References

  • Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See p. 21.

Crossrefs

Programs

Formula

a(n) = A010050(A005097(n-1)). a(n)^2 = A177926(n). - R. J. Mathar, May 24 2010