|
%I #34 Dec 27 2023 08:37:42
%S 1,7,20,24,23,16,25,1,7,20,24,23,16,25,1,7,20,24,23,16,25,1,7,20,24,
%T 23,16,25,1,7,20,24,23,16,25,1,7,20,24,23,16,25,1,7,20,24,23,16,25,1,
%U 7,20,24,23,16,25,1,7,20,24,23,16,25,1,7,20,24,23,16,25,1,7,20,24,23,16,25
%N a(n) = 7^n mod 29.
%H G. C. Greubel, <a href="/A070413/b070413.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,1).
%F From _R. J. Mathar_, Apr 20 2010: (Start)
%F a(n) = a(n-7).
%F G.f.: ( -1-7*x-20*x^2-24*x^3-23*x^4-16*x^5-25*x^6 ) / ( (x-1)*(1+x+x^2+x^3+x^4+x^5+x^6) ). (End)
%t PowerMod[7, Range[0, 50], 29] (* _G. C. Greubel_, Mar 20 2016 *)
%o (Sage) [power_mod(7,n,29) for n in range(0,77)] # _Zerinvary Lajos_, Nov 27 2009
%o (PARI) a(n) = lift(Mod(7, 29)^n); \\ _Altug Alkan_, Mar 20 2016
%o (Magma) [Modexp(7, n, 29): n in [0..100]]; // _Bruno Berselli_, Mar 22 2016
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_, May 12 2002
|
