login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A294507 Sum(m^p, m=1..p-1) / p^2 as p runs through the odd primes. 3

%I #10 Nov 01 2017 15:28:16

%S 1,52,7689,1176564625,915495729492,1507470694179701824,

%T 2916521865098581522761,21333370304597346190818638521,

%U 1675481131512375613482932303229309861556,9784120259254858957467327917016090730358625,4284997268972399392421947270075253022799901265537333204

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

%F a(n) = A219550(n) / prime(n+1) = A219550(n) / A065091(n).

%F a(n) (mod prime(n+1)) = (prime(n+1) - 1)/2 = A005097(n).

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

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

%Y Cf. A005097, A055030, A065091, A219550.

%K nonn

%O 1,2

%A _Jonathan Sondow_, Nov 01 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 1 10:33 EDT 2024. Contains 375584 sequences. (Running on oeis4.)