A note on recurrence sequences
英文摘要：
In this note we provide a simple formula of general term of recurrent sequence.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
Efficient computation of terms of linear recurrence sequences of any order
In this paper we give efficient algorithms for computing second-, third-, and fourth-order linear recurrences. We also present an algorithm scheme for computing terms with the indices $N,\ldots,N+n-1$ of an $n$th-order linear recurrence. Unlike Fiduccia's algorithm our approach uses certain formulas for modular polynomial squarings.
math.NTmath.RA
Linear recurrences indexed by $\mathbb{Z}$
This note considers linear recurrences (also called linear difference equations) in unknowns indexed by the integers. We characterize a unique \emph{reduced} linear recurrence with the same solutions as a given linear recurrence, and construct a \emph{solution matrix} which parametrizes the space of solutions. Several properties of solution matrices are shown, including a combinatorial characterization of bases and dimension of the space of solutions.
math.COmath.RA
Recurrence matrices
We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.
math.COmath.RA
