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.
%I A294507 #10 Nov 01 2017 15:28:16
%S A294507 1,52,7689,1176564625,915495729492,1507470694179701824,
%T A294507 2916521865098581522761,21333370304597346190818638521,
%U A294507 1675481131512375613482932303229309861556,9784120259254858957467327917016090730358625,4284997268972399392421947270075253022799901265537333204
%N A294507 Sum(m^p, m=1..p-1) / p^2 as p runs through the odd primes.
%F A294507 a(n) = A219550(n) / prime(n+1) = A219550(n) / A065091(n).
%F A294507 a(n) (mod prime(n+1)) = (prime(n+1) - 1)/2 = A005097(n).
%e A294507 a(1) = (1^3 + 2^3)/3^2 = (1 + 8)/9 = 1.
%t A294507 Table[ p = Prime[n]; Sum[ m^p, {m, 1, p - 1}] / p^2, {n, 2, 12}]
%Y A294507 Cf. A005097, A055030, A065091, A219550.
%K A294507 nonn
%O A294507 1,2
%A A294507 _Jonathan Sondow_, Nov 01 2017