|
%I #21 Sep 08 2022 08:44:58
%S 0,0,1,1,3,1,8,10,11,12,13,13,31,37,31,41,42,47,58,60,82,86,95,76,125,
%T 123,140,103,115,134,188,229,235,213,186,239,264,283,244,243,263,342,
%U 369,430,387,407,473,413,446,489,522,492,558,570,569,547,692
%N a(n) = Sum_{k=1..n} T(n,k), array T as in A049759.
%H Charles R Greathouse IV, <a href="/A049760/b049760.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = Sum_{i=1..n} (n^2 mod i). - _Wesley Ivan Hurt_, Sep 15 2017
%p seq( add( `mod`(n^2, k), k = 1..n), n = 1..60); # _G. C. Greubel_, Dec 14 2019
%t Table[Sum[Mod[n^2, i], {i, n}], {n, 60}] (* _Vincenzo Librandi_, Sep 18 2017 *)
%t Table[Sum[PowerMod[n,2,k],{k,n}],{n,60}] (* _Harvey P. Dale_, Mar 29 2018 *)
%o (PARI) a(n)=my(N=n^2);sum(k=2,n-1,N%k) \\ _Charles R Greathouse IV_, Mar 27 2014
%o (Magma) [&+[n^2 mod i: i in [1..n]]: n in [1..60]]; // _Vincenzo Librandi_, Sep 18 2017
%o (Sage) [sum(power_mod(n,2,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,2,k)) ); # _G. C. Greubel_, Dec 14 2019
%Y Row sums of A049759.
%K nonn,easy
%O 1,5
%A _Clark Kimberling_
|
