%I #31 Dec 25 2023 13:46:31
%S 1,5,25,29,17,21,9,13,1,5,25,29,17,21,9,13,1,5,25,29,17,21,9,13,1,5,
%T 25,29,17,21,9,13,1,5,25,29,17,21,9,13,1,5,25,29,17,21,9,13,1,5,25,29,
%U 17,21,9,13,1,5,25,29,17,21,9,13,1,5,25,29,17,21,9,13,1,5,25,29,17,21,9
%N a(n) = 5^n mod 32.
%H G. C. Greubel, <a href="/A070380/b070380.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,1). [_R. J. Mathar_, Apr 20 2010]
%F From _R. J. Mathar_, Apr 20 2010: (Start)
%F a(n) = a(n-8).
%F G.f.: ( -1-5*x-25*x^2-29*x^3-17*x^4-21*x^5-9*x^6-13*x^7 ) / ( (x-1)*(1+x)*(x^2+1)*(x^4+1) ). (End)
%t PowerMod[5, Range[0, 50], 32] (* _G. C. Greubel_, Mar 16 2016 *)
%o (Sage) [power_mod(5,n,32)for n in range(0,79)] # _Zerinvary Lajos_, Nov 26 2009
%o (PARI) a(n) = lift(Mod(5, 32)^n); \\ _Altug Alkan_, Mar 16 2016
%K nonn
%O 0,2
%A _N. J. A. Sloane_, May 12 2002
|