|
%I #25 Dec 27 2023 08:37:22
%S 1,6,36,31,1,6,36,31,1,6,36,31,1,6,36,31,1,6,36,31,1,6,36,31,1,6,36,
%T 31,1,6,36,31,1,6,36,31,1,6,36,31,1,6,36,31,1,6,36,31,1,6,36,31,1,6,
%U 36,31,1,6,36,31,1,6,36,31,1,6,36,31,1,6,36,31,1,6,36,31,1,6,36,31,1,6,36,31
%N a(n) = 6^n mod 37.
%H G. C. Greubel, <a href="/A070400/b070400.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,-1,1).
%F From _R. J. Mathar_, Apr 20 2010: (Start)
%F a(n) = a(n-1) - a(n-2) + a(n-3).
%F G.f.: ( -1-5*x-31*x^2 ) / ( (x-1)*(1+x^2) ). (End)
%F From _G. C. Greubel_, Mar 19 2016: (Start)
%F a(n) = a(n-4).
%F a(n) = (1/2)*(37 - 35*cos(n*Pi/2) - 25*sin(n*Pi/2)).
%F E.g.f.: (1/2)*(37*exp(x) - 35*cos(x) - 25*sin(x)). (End)
%t PowerMod[6, Range[0, 50], 37] (* _G. C. Greubel_, Mar 19 2016 *)
%o (Sage) [power_mod(6,n,37)for n in range(0,84)] # _Zerinvary Lajos_, Nov 27 2009
%o (PARI) a(n)=lift(Mod(6,37)^n) \\ _Charles R Greathouse IV_, Mar 22 2016
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_, May 12 2002
|
