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.

A294507 Sum(m^p, m=1..p-1) / p^2 as p runs through the odd primes.

Original entry on oeis.org

1, 52, 7689, 1176564625, 915495729492, 1507470694179701824, 2916521865098581522761, 21333370304597346190818638521, 1675481131512375613482932303229309861556, 9784120259254858957467327917016090730358625, 4284997268972399392421947270075253022799901265537333204
Offset: 1

Views

Author

Jonathan Sondow, Nov 01 2017

Keywords

Examples

			a(1) = (1^3 + 2^3)/3^2 = (1 + 8)/9 = 1.
		

Crossrefs

Programs

  • Mathematica
    Table[ p = Prime[n]; Sum[ m^p, {m, 1, p - 1}] / p^2, {n, 2, 12}]

Formula

a(n) = A219550(n) / prime(n+1) = A219550(n) / A065091(n).
a(n) (mod prime(n+1)) = (prime(n+1) - 1)/2 = A005097(n).