OFFSET
1,5
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
FORMULA
a(n) = Sum_{i=1..n} (n^3 mod i). - Wesley Ivan Hurt, Sep 15 2017
MAPLE
seq( add( `mod`(n^3, k), k = 1..n), n = 1..60); # G. C. Greubel, Dec 14 2019
MATHEMATICA
Table[Sum[Mod[n^3, i], {i, n}], {n, 60}] (* Vincenzo Librandi, Sep 18 2017 *)
PROG
(Magma) [&+[n^3 mod i: i in [1..n]]: n in [1..60]]; // Vincenzo Librandi, Sep 18 2017
(PARI) vector(60, n, sum(k=1, n, lift(Mod(n, k)^3)) ) \\ G. C. Greubel, Dec 14 2019
(Sage) [sum(power_mod(n, 3, k) for k in (1..n)) for n in (1..60)] # G. C. Greubel, Dec 14 2019
(GAP) List([1..60], n-> Sum([1..n], k-> PowerMod(n, 3, k)) ); # G. C. Greubel, Dec 14 2019
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved