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 A070597 #19 Feb 02 2021 20:29:22
%S A070597 0,1,8,3,4,5,0,7,8,9,4,11,0,1,8,3,4,5,0,7,8,9,4,11,0,1,8,3,4,5,0,7,8,
%T A070597 9,4,11,0,1,8,3,4,5,0,7,8,9,4,11,0,1,8,3,4,5,0,7,8,9,4,11,0,1,8,3,4,5,
%U A070597 0,7,8,9,4,11,0,1,8,3,4,5,0,7,8,9,4,11,0,1,8,3,4,5,0,7,8,9,4,11,0,1,8,3
%N A070597 Duplicate of A070474.
%C A070597 a(n)=A070474(n) [Proof: n^5-n^3 == 0 (mod 12) is shown explicitly for n=0 to 11, then the induction n->n+12 for the 5th-order polynomial followed by binomial expansion of (n+12)^k concludes that the zero (mod 12) is periodically extended to the other integers.] - _R. J. Mathar_, Jul 23 2009
%t A070597 Table[Mod[n^5,12],{n,0,200}] (* _Vladimir Joseph Stephan Orlovsky_, Apr 23 2011 *)
%o A070597 (Sage) [power_mod(n,7,12) for n in range(0, 100)] # _Zerinvary Lajos_, Oct 28 2009
%Y A070597 Cf. A008960, A070474.
%K A070597 dead
%O A070597 0,3
%A A070597 _N. J. A. Sloane_, May 13 2002