|
%I #33 Dec 27 2023 08:37:01
%S 1,5,25,37,9,1,5,25,37,9,1,5,25,37,9,1,5,25,37,9,1,5,25,37,9,1,5,25,
%T 37,9,1,5,25,37,9,1,5,25,37,9,1,5,25,37,9,1,5,25,37,9,1,5,25,37,9,1,5,
%U 25,37,9,1,5,25,37,9,1,5,25,37,9,1,5,25,37,9,1,5,25,37,9,1,5,25,37,9,1,5
%N a(n) = 5^n mod 44.
%H G. C. Greubel, <a href="/A070390/b070390.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (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-5).
%F G.f.: ( -1-5*x-25*x^2-37*x^3-9*x^4 ) / ( (x-1)*(1+x+x^2+x^3+x^4) ). (End)
%t PowerMod[5,Range[0,90],44] (* or *) LinearRecurrence[{0,0,0,0,1}, {1,5,25,37,9},90] (* _Harvey P. Dale_, Apr 21 2011 *)
%o (Sage) [power_mod(5,n,44)for n in range(0,87)] # _Zerinvary Lajos_, Nov 26 2009
%o (PARI) a(n) = lift(Mod(5, 44)^n); \\ _Altug Alkan_, Mar 18 2016
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_, May 12 2002
|
