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