This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A341412 #19 Dec 02 2023 14:00:57
%S A341412 0,1,0,3,1,1,0,3,0,1,10,7,8,7,6,3,4,13,2,15,0,3,21,19,1,13,0,7,21,1,
%T A341412 21,3,12,23,21,31,21,15,12,35,21,13,21,31,36,45,21,19,0,1,33,39,21,31,
%U A341412 46,35,42,33,21,55,21,29,0,3,46,49,21,31,27,21,21,67,21,17
%N A341412 a(n) = (Sum_{k=1..6} k^n) mod n.
%H A341412 Seiichi Manyama, <a href="/A341412/b341412.txt">Table of n, a(n) for n = 1..10000</a>
%F A341412 a(n) = A001553(n) mod n.
%F A341412 a(A056745(n)) = 0.
%p A341412 a:= n-> add(i&^n, i=1..6) mod n:
%p A341412 seq(a(n), n=1..100); # _Alois P. Heinz_, Feb 11 2021
%t A341412 a[n_] := Mod[Sum[k^n, {k, 1, 6}], n]; Array[a, 100] (* _Amiram Eldar_, Feb 11 2021 *)
%t A341412 Table[Mod[Total[Range[6]^n],n],{n,100}] (* _Harvey P. Dale_, Dec 02 2023 *)
%o A341412 (PARI) a(n) = sum(k=1, 6, k^n)%n;
%Y A341412 (Sum_{k=1..m} k^n) mod n: A096196 (m=2), A341409 (m=3), A341410 (m=4), A341411 (m=5), this sequence (m=6), A341413 (m=7).
%Y A341412 Cf. A001553, A056745.
%K A341412 nonn,easy
%O A341412 1,4
%A A341412 _Seiichi Manyama_, Feb 11 2021