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