In this paper, firstly, we introduced a second order non-linear recursive sequence, then we use this sequence and the combinatorial methods to perform a deep study on the computational problem concerning one kind sums, which includes the Chebyshev polynomials. This makes it possible to simplify a class of complex computations involving the second type Chebyshev polynomials into a very simple problem. Finally, we give a new and interesting identity for it.
The main aim of this paper is that for any second-order linear recurrence sequence, the generating function of which is , we can give the exact coefficient expression of the power series expansion of for with elementary methods and symmetry properties. On the other hand, if we take some special values for a and b, not only can we obtain the convolution formula of some important polynomials, but also we can establish the relationship between polynomials and themselves. For example, we can find relationship between the Chebyshev polynomials and Legendre polynomials.
In this article, we used the elementary methods and the properties of the classical Gauss sums to study the problem of calculating some Gauss sums. In particular, we obtain some interesting calculating formulas for the Gauss sums corresponding to the eight-order and twelve-order characters modulo p, where p be an odd prime with or .
In this paper, we introduce the fourth-order linear recurrence sequence and its generating function and obtain the exact coefficient expression of the power series expansion using elementary methods and symmetric properties of the summation processes. At the same time, we establish some relations involving Tetranacci numbers and give some interesting identities.
The main purpose of this paper is to find explicit expressions for two sequences and to solve two related conjectures arising from the recent study of sums of finite products of Catalan numbers by Zhang and Chen.