|
%I #20 Sep 08 2022 08:44:58
%S 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,
%T 160,144,132,172,103,218,232,220,245,251,210,299,330,344,315,413,275,
%U 456,392,383,472,502,479,449,553,557,626,646,632,628,618,771
%N a(n) = Sum_{k=1..n} T(n,k), array T as in A049761.
%H Vincenzo Librandi, <a href="/A049762/b049762.txt">Table of n, a(n) for n = 1..1000</a>
%F a(n) = Sum_{i=1..n} (n^3 mod i). - _Wesley Ivan Hurt_, Sep 15 2017
%p seq( add( `mod`(n^3, k), k = 1..n), n = 1..60); # _G. C. Greubel_, Dec 14 2019
%t Table[Sum[Mod[n^3, i], {i, n}], {n, 60}] (* _Vincenzo Librandi_, Sep 18 2017 *)
%o (Magma) [&+[n^3 mod i: i in [1..n]]: n in [1..60]]; // _Vincenzo Librandi_, Sep 18 2017
%o (PARI) vector(60, n, sum(k=1,n, lift(Mod(n,k)^3)) ) \\ _G. C. Greubel_, Dec 14 2019
%o (Sage) [sum(power_mod(n,3,k) for k in (1..n)) for n in (1..60)] # _G. C. Greubel_, Dec 14 2019
%o (GAP) List([1..60], n-> Sum([1..n], k-> PowerMod(n,3,k)) ); # _G. C. Greubel_, Dec 14 2019
%Y Row sums of A049761.
%Y Cf. A049759, A049760, A049763, A049764.
%K nonn,easy
%O 1,5
%A _Clark Kimberling_
|
