|
| |
|
|
A049772
|
|
a(n) = Sum_{k=1..n} T(n,k), array T as in A049771.
|
|
2
|
|
|
|
0, 1, 3, 3, 7, 14, 19, 11, 33, 43, 62, 48, 70, 102, 80, 48, 180, 155, 204, 225, 242, 287, 257, 273, 337, 406, 348, 430, 555, 419, 530, 460, 704, 805, 666, 622, 800, 948, 774, 675, 1040, 1124, 1147, 1119, 1364, 1343, 1237, 995, 1415
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
|
|
|
MAPLE
|
seq( add( `mod`(k^4, n) + `mod`(n^4, k), k = 1..n), n = 1..50); # G. C. Greubel, Dec 16 2019
|
|
|
MATHEMATICA
|
Table[Sum[PowerMod[k, 4, n] + PowerMod[n, 4, k], {k, n}], {n, 50}] (* G. C. Greubel, Dec 16 2019 *)
|
|
|
PROG
|
(PARI) T(n, k) = lift(Mod(k, n)^4) + lift(Mod(n, k)^4);
vector(50, n, sum(k=1, n, T(n, k)) ) \\ G. C. Greubel, Dec 16 2019
(Magma) [&+[Modexp(k, 4, n) + Modexp(n, 4, k): k in [1..n]]: n in [1..50]]; // G. C. Greubel, Dec 16 2019
(Sage) [sum(power_mod(k, 4, n) + power_mod(n, 4, k) for k in (1..n)) for n in (1..50)] # G. C. Greubel, Dec 16 2019
(GAP) List([1..50], n-> Sum([1..n], k-> PowerMod(k, 4, n) + PowerMod(n, 4, k)) ); # G. C. Greubel, Dec 16 2019
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
