This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A049764 #21 Sep 08 2022 08:44:58
%S A049764 0,0,1,1,3,1,5,7,9,10,18,10,18,25,28,40,44,26,52,79,60,78,73,101,117,
%T A049764 133,114,136,91,90,158,188,220,244,218,220,208,283,280,303,220,319,
%U A049764 287,393,398,446,391,459,435,534,481,471,428,499
%N A049764 a(n) = Sum_{k=1..n} T(n,k), array T as in A049763.
%H A049764 Vincenzo Librandi, <a href="/A049764/b049764.txt">Table of n, a(n) for n = 1..1000</a>
%F A049764 a(n) = Sum_{i=1..n} (n^4 mod i). - _Wesley Ivan Hurt_, Sep 15 2017
%p A049764 seq( add( `mod`(n^4, k), k = 1..n), n = 1..60); # _G. C. Greubel_, Dec 13 2019
%t A049764 Table[Sum[Mod[n^4, i], {i, n}], {n, 60}] (* _Vincenzo Librandi_, Sep 18 2017 *)
%t A049764 Table[Sum[PowerMod[n,4,i],{i,n}],{n,60}] (* _Harvey P. Dale_, Aug 29 2021 *)
%o A049764 (Magma) [&+[n^4 mod i: i in [1..n]]: n in [1..60]]; // _Vincenzo Librandi_, Sep 18 2017
%o A049764 (PARI) a(n) = sum(i=1, n, lift(Mod(n, i)^4)); \\ _Michel Marcus_, Sep 18 2017
%o A049764 (Sage) [sum(power_mod(n,4,k) for k in (1..n)) for n in (1..60)] # _G. C. Greubel_, Dec 13 2019
%o A049764 (GAP) List([1..60], n-> Sum([1..n], k-> PowerMod(n,4,k)) ); # _G. C. Greubel_, Dec 13 2019
%Y A049764 Row sums of A049763.
%K A049764 nonn,easy
%O A049764 1,5
%A A049764 _Clark Kimberling_