The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A049764 a(n) = Sum_{k=1..n} T(n,k), array T as in A049763. 4

%I

%S 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 133,114,136,91,90,158,188,220,244,218,220,208,283,280,303,220,319,

%U 287,393,398,446,391,459,435,534,481,471,428,499

%N a(n) = Sum_{k=1..n} T(n,k), array T as in A049763.

%H Vincenzo Librandi, <a href="/A049764/b049764.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = Sum_{i=1..n} (n^4 mod i). - _Wesley Ivan Hurt_, Sep 15 2017

%p seq( add( `mod`(n^4, k), k = 1..n), n = 1..60); # _G. C. Greubel_, Dec 13 2019

%t Table[Sum[Mod[n^4, i], {i, n}], {n, 60}] (* _Vincenzo Librandi_, Sep 18 2017 *)

%o (MAGMA) [&+[n^4 mod i: i in [1..n]]: n in [1..60]]; // _Vincenzo Librandi_, Sep 18 2017

%o (PARI) a(n) = sum(i=1, n, lift(Mod(n, i)^4)); \\ _Michel Marcus_, Sep 18 2017

%o (Sage) [sum(power_mod(n,4,k) for k in (1..n)) for n in (1..60)] # _G. C. Greubel_, Dec 13 2019

%o (GAP) List([1..60], n-> Sum([1..n], k-> PowerMod(n,4,k)) ); # _G. C. Greubel_, Dec 13 2019

%Y Row sums of A049763.

%K nonn,easy

%O 1,5

%A _Clark Kimberling_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 11 03:22 EDT 2020. Contains 336421 sequences. (Running on oeis4.)