|
%I #37 Dec 27 2023 08:54:50
%S 1,7,5,2,3,10,4,6,9,8,1,7,5,2,3,10,4,6,9,8,1,7,5,2,3,10,4,6,9,8,1,7,5,
%T 2,3,10,4,6,9,8,1,7,5,2,3,10,4,6,9,8,1,7,5,2,3,10,4,6,9,8,1,7,5,2,3,
%U 10,4,6,9,8,1,7,5,2,3,10,4,6,9,8,1,7,5,2,3,10,4,6,9,8,1,7,5,2,3,10,4,6,9
%N a(n) = 7^n mod 11.
%H G. C. Greubel, <a href="/A070404/b070404.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,-1,1).
%F From _R. J. Mathar_, Apr 20 2010: (Start)
%F a(n) = a(n-1) - a(n-5) + a(n-6).
%F G.f.:( -1-6*x+2*x^2+3*x^3-x^4-8*x^5) / ((x-1)*(1+x)*(x^4-x^3+x^2-x+1)). (End)
%F a(n) = a(n-10). - _G. C. Greubel_, Mar 20 2016
%t PowerMod[7,Range[0,100],11] (* or *) LinearRecurrence[{1,0,0,0,-1,1},{1,7,5,2,3,10},100] (* _Harvey P. Dale_, Jul 17 2015 *)
%o (Sage) [power_mod(7,n,11) for n in range(0,99)] # _Zerinvary Lajos_, Nov 03 2009
%o (PARI) a(n) = lift(Mod(7, 11)^n); \\ _Altug Alkan_, Mar 20 2016
%o (Magma) [Modexp(7, n, 11): n in [0..100]]; // _Bruno Berselli_, Mar 22 2016
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_, May 12 2002
|
