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.

A229833 1/p^3 * numerator((sum_{j=1..p-1} j^(p-1)) - p*Bernoulli(p-1)) with p = prime(n).

Original entry on oeis.org

17, 1175, 67232195, 1282936297603, 171594913930219489, 368517627392700495869, 259067037992493907740808871, 63098504840897942292160460526547792021, 4948605372033572359620687688871811178548595, 169413083241708480729625174442441002390094469490644564301, 90165569601996395473034926239938857618854516797194687641929891
Offset: 3

Views

Author

Jonathan Sondow, Oct 16 2013

Keywords

Comments

Sum_{j=1..p-1} j^(p-1) == p*Bernoulli(p-1) (mod p^3) for prime p > 3 (see formulas (8) and (10) in "Lerch Quotients, ..."), so a(n) is an integer for n > 2.

Examples

			Prime(3) = 5 and 1/5^3 * numerator((sum_{j=1..4} j^4) - 5*Bernoulli(4)) = 1/125 * numerator(354 - 5*(-1/6)) = 2125/125 = 17, so a(3) = 17.
		

Crossrefs

Cf. A197630.

Programs

  • Mathematica
    Table[p = Prime[n]; Numerator[ Sum[j^(p - 1), {j, 1, p - 1}] - p*BernoulliB[p - 1]]/p^3, {n, 3, 13}]