%I #32 Dec 26 2023 06:37:44
%S 1,5,25,17,13,29,1,5,25,17,13,29,1,5,25,17,13,29,1,5,25,17,13,29,1,5,
%T 25,17,13,29,1,5,25,17,13,29,1,5,25,17,13,29,1,5,25,17,13,29,1,5,25,
%U 17,13,29,1,5,25,17,13,29,1,5,25,17,13,29,1,5,25,17,13,29,1,5,25,17,13,29
%N a(n) = 5^n mod 36.
%H G. C. Greubel, <a href="/A070383/b070383.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec"order_06">Index entries for linear recurrences with constant coefficients</a>, signature (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-6).
%F G.f.: ( -1-5*x-25*x^2-17*x^3-13*x^4-29*x^5 ) / ( (x-1)*(1+x)*(1+x+x^2)*(x^2-x+1) ). (End)
%t PowerMod[5, Range[0, 50], 36] (* _G. C. Greubel_, Mar 16 2016 *)
%o (Sage) [power_mod(5,n,36) for n in range(0,78)] # _Zerinvary Lajos_, Nov 26 2009
%o (PARI) a(n) = lift(Mod(5,36)^n); \\ _Altug Alkan_, Mar 16 2016
%K nonn
%O 0,2
%A _N. J. A. Sloane_, May 12 2002
|