相关论文: A note on recurrence sequences

Analogue of Springer's formula for the Poincar\'e series of the algebra invariants of ternary form is found.

In this note, we establish some new results on some special types of function algebras and also give new proofs to some existing ones

These informal notes deal with a number of questions related to sums and integrals in analysis.

We present a general method to obtain asymptotic power series for three kinds of sequences. And we give recurrence relations for determining the coefficients of asymptotic power series for these sequences. As applications, we show how these…

In this paper the approach to obtaining nonrecurrent formulas for some recursively defined sequences is illustrated. The most interesting result in the paper is the formula for the solution of quadratic map-like recurrence. Also, some…

In a recent paper, Frank Ruskey asked whether every linear recurrent sequence can occur in some solution of a meta-Fibonacci sequence. In this paper, we answer his question in the affirmative for recurrences with positive coefficients.

We introduce the notion of {\bf a}-walk $S(n)=a_1 X_1+\dots+a_n X_n$, based on a sequence of positive numbers ${\bf a}=(a_1,a_2,\dots)$ and a Rademacher sequence $X_1,X_2,\dots$. We study recurrence/transience (properly defined) of such…

Scattered sequences are a generalization of scattered polynomials. So far, only scattered sequences of order one and two have been constructed. In this paper an infinite family of scattered sequences of order three is obtained. Equivalence…

One of equivalents of the Riemann hypothesis is Li's criterion that all Li coefficients are positive. We study recurrence relations of Li coefficients in this note.

A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…

In this paper we present a method to pass from a recurrence relation having constant coefficients (in short, a C-recurrence) to a finite succession rule defining the same number sequence. We recall that succession rules are a recently…

This short note is a comment on a historical aspect of a famous formula dating from the 18th century.

This article investigates integer sequences that partition the sequence into blocks of various lengths - irregular arrays. The main result of the article is explicit formulas for numbering of irregular arrays. A generalization of Cantor…

In this note we show that if $(u_n)_{n\geqslant 1}$ is a simple linearly recurrent sequence of integers whose minimal recurrence of order $k$ involves only positive coefficients that has positive initial terms, then $(Mu_{n^s})_{n\geqslant…

We prove that the Lalescu sequence is monotonically decreasing.

An explicit formula for a strong connection form in a principal extension by a coseparable coalgebra is given.

A three term recurrence relation is derived for a basis consisting of polynomials multiplied by sines and cosines with large, but fixed frequencies. A numerical method for computing the coefficients of the three term recurrence relation is…

We present an elementary proof of the generalization of the $k$-bonacci Binet formula, a closed form calculation of the $k$-bonacci numbers using the roots of the characteristic polynomial of the $k$-bonacci recursion.

We generalize the concept of disjunction.

This paper reformulates the problem of finding a longest common increasing subsequence of the two given input sequences in a very succinct way. An extremely simple linear space algorithm based on the new formula can find a longest common…