|
%I #17 Dec 07 2019 12:18:23
%S 1,6,7,13,20,4,24,28,23,22,16,9,25,5,1,6,7,13,20,4,24,28,23,22,16,9,
%T 25,5,1,6,7,13,20,4,24,28,23,22,16,9,25,5,1,6,7,13,20,4,24,28,23,22,
%U 16,9,25,5,1,6,7,13,20,4,24,28,23,22,16,9,25,5,1,6,7,13,20,4,24,28,23,22,16
%N a(n) = 6^n mod 29.
%H G. C. Greubel, <a href="/A070398/b070398.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,-1,1). [From _R. J. Mathar_, Apr 20 2010]
%F From _R. J. Mathar_, Apr 20 2010: (Start)
%F a(n) = a(n-1) - a(n-7) + a(n-8).
%F G.f.: ( -1-5*x-x^2-6*x^3-7*x^4+16*x^5-20*x^6-5*x^7 ) / ( (x-1)*(1+x)*(x^6-x^5+x^4-x^3+x^2-x+1) ). (End)
%F a(n) = a(n-14). - _G. C. Greubel_, Mar 18 2016
%t PowerMod[6, Range[0, 50], 29] (* _G. C. Greubel_, Mar 18 2016 *)
%o (Sage) [power_mod(6,n,29)for n in range(0,81)] # _Zerinvary Lajos_, Nov 27 2009
%o (PARI) a(n) = lift(Mod(6, 29)^n); \\ _Altug Alkan_, Mar 18 2016
%K nonn
%O 0,2
%A _N. J. A. Sloane_, May 12 2002
|
