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.

A197631 Lerch remainders: the Lerch quotient A197630 of the n-th prime p modulo p, where n > 1.

Original entry on oeis.org

0, 3, 5, 5, 6, 12, 13, 3, 7, 19, 2, 21, 34, 33, 52, 31, 51, 38, 32, 25, 25, 25, 53, 22, 98, 0, 79, 42, 63, 123, 75, 11, 11, 39, 34, 151, 36, 137, 22, 49, 19, 144, 41, 44, 21, 5, 122, 4, 111, 10, 228, 194, 148, 20, 217, 193, 157, 202, 152, 87, 93, 30, 219
Offset: 2

Views

Author

Jonathan Sondow, Oct 16 2011

Keywords

Examples

			a(3) = A197630(3) mod Prime(3) = 13 mod 5 = 3.
		

Crossrefs

Programs

  • PARI
    a(n) = my(p=prime(n), m=p-1); sum(k=1, m, k^m, -p-m!)/p^2 % p;
    vector(100, n, a(n+1)) \\ Altug Alkan, Nov 22 2015

Formula

a(n) = A197630(n) mod Prime(n), with n >= 2.