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