login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A049762
a(n) = Sum_{k=1..n} T(n,k), array T as in A049761.
3
0, 0, 1, 1, 4, 1, 9, 7, 11, 12, 25, 18, 34, 34, 41, 32, 76, 44, 87, 64, 93, 85, 122, 75, 80, 160, 144, 132, 172, 103, 218, 232, 220, 245, 251, 210, 299, 330, 344, 315, 413, 275, 456, 392, 383, 472, 502, 479, 449, 553, 557, 626, 646, 632, 628, 618, 771
OFFSET
1,5
LINKS
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
Row sums of A049761.
Sequence in context: A235944 A299615 A353770 * A105495 A256831 A010644
KEYWORD
nonn,easy
STATUS
approved