|
%I #13 Dec 07 2019 12:18:26
%S 1,2,4,8,16,10,20,18,14,6,12,2,4,8,16,10,20,18,14,6,12,2,4,8,16,10,20,
%T 18,14,6,12,2,4,8,16,10,20,18,14,6,12,2,4,8,16,10,20,18,14,6,12,2,4,8,
%U 16,10,20,18,14,6,12,2,4,8,16,10,20,18,14,6,12,2,4,8,16,10,20,18,14,6
%N 2^n mod 22.
%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 0, 0, -1, 1).
%F a(n)= +a(n-1) -a(n-5) +a(n-6), n>6. .G.f.: (x+2*x^2+4*x^3+8*x^4-5*x^5+11*x^6+1)/ ((1-x) * (1+x) * (x^4-x^3+x^2-x+1)). - _R. J. Mathar_, Apr 13 2010
%t PowerMod[2,Range[0,80],22] (* _Harvey P. Dale_, Dec 11 2012 *)
%o (Sage) [power_mod(2,n,22)for n in range(0,84)] #
%o (PARI) a(n)=lift(Mod(2,22)^n) \\ _Charles R Greathouse IV_, Mar 22 2016
%K nonn,easy
%O 0,2
%A _Zerinvary Lajos_, Nov 03 2009
|
