|
%I #28 Dec 30 2023 23:47:35
%S 1,8,9,6,4,10,3,2,5,7,1,8,9,6,4,10,3,2,5,7,1,8,9,6,4,10,3,2,5,7,1,8,9,
%T 6,4,10,3,2,5,7,1,8,9,6,4,10,3,2,5,7,1,8,9,6,4,10,3,2,5,7,1,8,9,6,4,
%U 10,3,2,5,7,1,8,9,6,4,10,3,2,5,7,1,8,9,6,4,10,3,2,5,7,1,8,9,6,4,10,3,2,5,7,1,8,9,6,4,10,3,2,5,7,1,8,9,6,4,10,3,2,5,7
%N a(0) = 1, a(n+1) = -3*a(n) mod 11.
%H R. M. C. de Souza, H. M. de Oliveira and A. N. Kauffman, <a href="https://doi.org/10.1109/ISIT.1998.708898">Trigonometry in Finite Fields and a new Hartley Transform</a>, in Proceedings of the 1998 IEEE International Symposium on Information Theory. Cambridge: IEEE Press, 1998, page 293.
%H Joshua Ide and Marc S. Renault, <a href="https://www.fq.math.ca/Papers1/50-2/IdeRenault.pdf">Power Fibonacci Sequences</a>, Fib. Q. 50(2), 2012, 175-179.
%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,-1,1). [_R. J. Mathar_, Apr 20 2010]
%F a(n) = 8^n mod 11. - _Zerinvary Lajos_, Nov 28 2009
%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-7*x-x^2+3*x^3+2*x^4-7*x^5) / ( (x-1)*(1+x)*(x^4-x^3+x^2-x+1) ). (End)
%t NestList[Mod[-3#,11]&,1,120] (* _Harvey P. Dale_, Jun 15 2021 *)
%o (Sage) [power_mod(8,n,11)for n in range(0,120)] # _Zerinvary Lajos_, Nov 28 2009
%K easy,nonn
%O 0,2
%A Andre Neumann Kauffman (ank(AT)nlink.com.br)
|
