Related papers: A note on recurrence sequences

Modifying an idea of E. Brietzke we give simple proofs for the recurrence relations of some sequences of binomial sums which have previously been obtained by other more complicated methods.

In this article we present a new recurrence formula for a finite sum involving the Fibonacci sequence. Furthermore, we state an algorithm to compute the sum of a power series related to Fibonacci series, without the use of term-by-term…

This article present a new, direct and simple formula for constructing Mignotte sequences.

We give some results and conjectures about recurrence relations for certain sequences of binomial sums.

We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.

This note provides formula for determinant and inverse of r-circulant matrices with general sequences of third order. In other words, the study combines many papers in the literature.

In this paper we provided a formula for the $n$th term of the $k$-generalized Fibonacci-like sequence, a generalization of the well-known Fibonacci sequence, having $k$ arbitrary initial terms, where the succeeding terms are obtained by…

A simple proof of the celebrated theorem of Lee and Yang is attempted in this short note.

For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…

Given a linear recurrence of the form $c_n=a_1c_{n-1}+\cdots+a_j c_{n-j}$, it is well-known that $c_n=\sum_{r}p_r(n)r^n$, where the sum is taken over the set of characteristic roots and each $p_r(n)$ is some polynomial. We give a closed…

In this paper, we find a new recurrence formula fo the Euler zeta functions.

In this paper, we prove two results related to the solutions of norm form equations. Firstly, we give a finiteness result for sums of terms of linear recurrence sequences appearing in the coordinates of solutions of norm form equations.…

A general theorem on fibers of singular sets is presented.

We improve a result of Bennett concerning certain sequences involving sums of powers of positive integers.

The purpose of this note is to present a formulation of a given nonlinear ordinary differential equation into an equivalent system of linear ordinary differential equations. It is evident that the easiness of a such procedure would be able…

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.…

We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…

We study the generalized Hankel transform of the family of sequences satisfying the recurrence relation $a_{n+1} = \bigl(\alpha + \frac{\beta}{n+\gamma}\bigr) a_n$. We apply the obtained formula to several particular important sequences.…

Let x(n) be a recurrence relation. The main purpose of this article is to determine a recurrence for powers of x(n).

We find an explicit formula for the generating function for the squaring the terms of an $\ell^{th}$ order linear recurrence.