An Algorithm for Calculating Terms of a Number Sequence using an Auxiliary Sequence

2016/03/21 by Bengt Månsson, Månsson, Bengt
Computer Science · Engineering · Mathematics · #Advanced Data Processing Techniques #Computability, Logic, AI Algorithms #Computational Physics and Python Applications #FOS: Mathematics #Number Theory (math.NT) #math.NT

paper · pdf · doi:10.48550/arxiv.1603.06623

16 pages

openalex publication_date 2016/03/21 · arxiv created 2016/04/01 · arxiv updated 2016/04/04 · openalex created_date 2022/08/31 · openalex updated_date 2026/07/28

Abstract

Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is derived for calculating the nth term even without an expression in closed form.

Related

• A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence
• A method for obtaining the algebraic generating function from a series
• Recurrence Relations for Some Integer Sequences Related to Ward Numbers
• Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems
• Algebraic relations for recursive sequences