login
This site is supported by donations to The OEIS Foundation.

 

Logo


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. 1
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, 133, 114, 136, 91, 90, 158, 188, 220, 244, 218, 220, 208, 283, 280, 303, 220, 319, 287, 393, 398, 446, 391, 459, 435, 534, 481, 471, 428, 499 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

FORMULA

a(n) = Sum_{i=1..n} (n^4 mod i). - Wesley Ivan Hurt, Sep 15 2017

MATHEMATICA

Table[Sum[Mod[n^4, i], {i, n}], {n, 60}] (* Vincenzo Librandi, Sep 18 2017 *)

PROG

(MAGMA) [&+[n^4 mod i: i in [1..n]]: n in [1..60]]; // Vincenzo Librandi, Sep 18 2017

(PARI) a(n) = sum(i=1, n, lift(Mod(n, i)^4)); \\ Michel Marcus, Sep 18 2017

CROSSREFS

Cf. A049763.

Sequence in context: A171998 A159285 A021080 * A136437 A137328 A140991

Adjacent sequences:  A049761 A049762 A049763 * A049765 A049766 A049767

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 23 23:51 EDT 2019. Contains 328379 sequences. (Running on oeis4.)