|
%I #23 Dec 27 2023 08:37:07
%S 1,6,13,9,8,2,12,3,18,16,4,1,6,13,9,8,2,12,3,18,16,4,1,6,13,9,8,2,12,
%T 3,18,16,4,1,6,13,9,8,2,12,3,18,16,4,1,6,13,9,8,2,12,3,18,16,4,1,6,13,
%U 9,8,2,12,3,18,16,4,1,6,13,9,8,2,12,3,18,16,4,1,6,13,9,8,2,12,3,18,16,4
%N a(n) = 6^n mod 23.
%H G. C. Greubel, <a href="/A070396/b070396.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%F From _R. J. Mathar_, Apr 20 2010: (Start)
%F a(n) = a(n-11).
%F G..f: ( -1-6*x-13*x^2-9*x^3-8*x^4-2*x^5-12*x^6-3*x^7-18*x^8-16*x^9-4*x^10 ) / ( (x-1)*(1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8+x^9+x^10) ). (End)
%t PowerMod[6,Range[0,90],23] (* _Harvey P. Dale_, Sep 15 2011 *)
%o (Sage) [power_mod(6,n,23)for n in range(0,88)] # _Zerinvary Lajos_, Nov 27 2009
%o (PARI) a(n) = lift(Mod(6, 23)^n); \\ _Altug Alkan_, Mar 18 2016
%K nonn
%O 0,2
%A _N. J. A. Sloane_, May 12 2002
|
