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 A070593 #19 Dec 16 2024 17:10:30
%S A070593 0,1,4,5,2,3,6,0,1,4,5,2,3,6,0,1,4,5,2,3,6,0,1,4,5,2,3,6,0,1,4,5,2,3,
%T A070593 6,0,1,4,5,2,3,6,0,1,4,5,2,3,6,0,1,4,5,2,3,6,0,1,4,5,2,3,6,0,1,4,5,2,
%U A070593 3,6,0,1,4,5,2,3,6,0,1,4,5,2,3,6,0,1,4,5,2,3,6,0,1,4,5,2,3,6,0,1,4
%N A070593 a(n) = n^5 mod 7.
%C A070593 Equivalently n^11 mod 7. - _Zerinvary Lajos_, Nov 07 2009
%H A070593 <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,1).
%t A070593 Table[If[Mod[n, 7] == 0, 0, ModularInverse[n, 7]], {n, 0, 100}] (* _Jean-François Alcover_, May 03 2017 *)
%t A070593 PowerMod[Range[0,100],5,7] (* _Harvey P. Dale_, Dec 16 2024 *)
%o A070593 (Sage) [power_mod(n,5,7)for n in range(0, 101)] # _Zerinvary Lajos_, Nov 07 2009
%o A070593 (Sage) [power_mod(n,11,7)for n in range(0, 101)] # _Zerinvary Lajos_, Nov 07 2009
%o A070593 (PARI) a(n)=n^5%7 \\ _Charles R Greathouse IV_, Apr 06 2016
%K A070593 nonn,easy
%O A070593 0,3
%A A070593 _N. J. A. Sloane_, May 13 2002