|
%I #34 Dec 26 2023 06:37:48
%S 1,5,25,26,31,23,16,14,4,20,1,5,25,26,31,23,16,14,4,20,1,5,25,26,31,
%T 23,16,14,4,20,1,5,25,26,31,23,16,14,4,20,1,5,25,26,31,23,16,14,4,20,
%U 1,5,25,26,31,23,16,14,4,20,1,5,25,26,31,23,16,14,4,20,1,5,25,26,31,23,16
%N a(n) = 5^n mod 33.
%H G. C. Greubel, <a href="/A070381/b070381.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,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-10).
%F G.f.: ( -1-5*x-25*x^2-26*x^3-31*x^4-23*x^5-16*x^6-14*x^7-4*x^8-20*x^9 ) / ( (x-1)*(1+x)*(x^4+x^3+x^2+x+1)*(x^4-x^3+x^2-x+1) ). (End)
%t PowerMod[5,Range[0,80],33] (* or *) PadRight[{},80,{1,5,25,26,31,23,16,14,4,20}] (* _Harvey P. Dale_, Jan 21 2014 *)
%o (Sage) [power_mod(5,n,33) for n in range(0,77)] # _Zerinvary Lajos_, Nov 26 2009
%o (PARI) a(n) = lift(Mod(5, 33)^n); \\ _Altug Alkan_, Mar 16 2016
%K nonn
%O 0,2
%A _N. J. A. Sloane_, May 12 2002
|
