The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A341411 a(n) = (Sum_{k=1..5} k^n) mod n. 5
0, 1, 0, 3, 0, 1, 1, 3, 0, 5, 4, 7, 2, 13, 0, 3, 15, 13, 15, 19, 15, 11, 15, 19, 0, 3, 0, 27, 15, 25, 15, 3, 27, 21, 15, 31, 15, 17, 30, 19, 15, 19, 15, 11, 0, 9, 15, 19, 1, 25, 21, 43, 15, 31, 25, 27, 54, 55, 15, 19, 15, 55, 36, 3, 5, 55, 15, 27, 18, 55, 15, 67, 15, 55 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
a(n) = A001552(n) mod n.
a(A056741(n)) = 0.
MAPLE
a:= n-> add(i&^n, i=1..5) mod n:
seq(a(n), n=1..100); # Alois P. Heinz, Feb 11 2021
MATHEMATICA
a[n_] := Mod[Sum[k^n, {k, 1, 5}], n]; Array[a, 100] (* Amiram Eldar, Feb 11 2021 *)
PROG
(PARI) a(n) = sum(k=1, 5, k^n)%n;
CROSSREFS
(Sum_{k=1..m} k^n) mod n: A096196 (m=2), A341409 (m=3), A341410 (m=4), this sequence (m=5), A341412 (m=6), A341413 (m=7).
Sequence in context: A091614 A350829 A249767 * A174433 A174624 A029358
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Feb 11 2021
STATUS
approved

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 May 19 07:00 EDT 2024. Contains 372666 sequences. (Running on oeis4.)