A380970 a(n) = Sum_{k=1..p-1} floor(k^p/p) where p is prime(n).
0, 2, 258, 53820, 12942210870, 11901444483390, 25627001801054931000, 55413915436873048932450, 490667517005738962388828685972, 48588952813858892791005036793649985985110, 303307728036900627681487165427498812641117360, 158544898951978777519612048992784361843596346824881328530
Offset: 1
Keywords
Links
- Jean-Christophe Pain, Congruence properties of prime sums and Bernoulli polynomials, arXiv:2502.04731 [math.HO], 2025.
Programs
-
PARI
a(n) = my(p=prime(n)); sum(k=1, p-1, k^p\p);
Formula
For n>1, a(n) mod p = (p+1)/2 where p is prime(n).