login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

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

%I #12 Sep 08 2022 08:44:58

%S 0,1,4,5,14,16,30,23,38,57,80,78,112,125,146,128,212,179,258,244,303,

%T 316,375,315,330,485,387,496,578,538,683,616,748,806,846,750,965,1033,

%U 1085,1035,1233,1136,1359,1316,1328,1507,1583

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

%H G. C. Greubel, <a href="/A049770/b049770.txt">Table of n, a(n) for n = 1..1000</a>

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

%t Table[Sum[PowerMod[k,3,n] + PowerMod[n,3,k], {k,n}], {n,50}] (* _G. C. Greubel_, Dec 13 2019 *)

%o (PARI) T(n,k) = lift(Mod(k,n)^3) + lift(Mod(n,k)^3);

%o vector(50, n, sum(k=1,n, T(n,k)) ) \\ _G. C. Greubel_, Dec 13 2019

%o (Magma) [&+[Modexp(k,3,n) + Modexp(n,3,k): k in [1..n]]: n in [1..50]]; // _G. C. Greubel_, Dec 13 2019

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

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

%Y Row sums of A049769.

%K nonn

%O 1,3

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 13:02 EDT 2024. Contains 371969 sequences. (Running on oeis4.)