Some Convolution Formulae Related to the Second-Order Linear Recurrence Sequence

Abstract

The main aim of this paper is that for any second-order linear recurrence sequence, the generating function of which is $f\left(t\right)=\frac{1}{1+at+b{t}^2}$, we can give the exact coefficient expression of the power series expansion of $f^x\left(t\right)$ for $x\in \mathbf{R}$ 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.

1. Introduction

For any integer $n\ge 1$ and any real number y, the Fibonacci polynomials $F_n\left(y\right)$ and the Lucas polynomials $L_n\left(y\right)$ are defined by the second-order linear recurrence sequence

$$F_{n+1}\left(y\right)=y{F}_n\left(y\right)+F_{n-1}\left(y\right)$$

and

$$L_{n+1}\left(y\right)=y{L}_n\left(y\right)+L_{n-1}\left(y\right),$$

where the first two terms are $F_0\left(y\right)=0$, $F_1\left(y\right)=1$, $L_0\left(y\right)=2$ and $L_1\left(y\right)=y$.

If we take $\alpha =\frac{y+\sqrt{y^2+4}}{2}$, $\beta =\frac{y-\sqrt{y^2+4}}{2}$, according to the properties of the second-order linear recurrence sequence, we have

$$F_n\left(y\right)=\frac{{\alpha }^n-{\beta }^n}{\alpha -\beta }$$

and

$$L_n\left(y\right)={\alpha }^n+{\beta }^n.$$

For any integer $n\ge 0$, the Fibonacci numbers $F_n=F_n\left(1\right)$ can be defined by the generating function

$$\begin{array}{c}\hfill \frac{1}{1-t-t^2}=\sum _{n=0}^{\infty }{F}_n{t}^n.\end{array}$$

For any integer $n\ge 0$, the first and the second kind Chebyshev polynomials $T_n\left(y\right)$ and $U_n\left(y\right)$ are defined by the second-order linear recurrence sequence

$$T_{n+2}\left(y\right)=2y{T}_{n+1}\left(y\right)-T_n\left(y\right)$$

and

$$U_{n+2}\left(y\right)=2y{U}_{n+1}\left(y\right)-U_n\left(y\right),$$

where the first two terms are $T_0\left(y\right)=1$, $T_1\left(y\right)=y$, $U_0\left(y\right)=1$ and $U_1\left(y\right)=2y$.

If we take $\alpha =y+\sqrt{y^2-1}$, $\beta =y-\sqrt{y^2-1}$, according to the properties of the second-order linear recurrence sequence, we have

$$T_n\left(y\right)=\frac{{\alpha }^n+{\beta }^n}{2}$$

and

$$U_n\left(y\right)=\frac{{\alpha }^{n+1}-{\beta }^{n+1}}{\alpha -\beta }.$$

On the other hand, the second kind Chebyshev polynomials $U_n\left(y\right)$ can be also defined by the generating function

$$\begin{array}{c}\hfill \frac{1}{1-2yt+t^2}=\sum _{n=0}^{\infty }{U}_n\left(y\right)t^n.\end{array}$$

Besides Fibonacci polynomials, Lucas polynomials and Chebyshev polynomials, other orthogonal polynomials have also been studied by interested scholars.

For example, the Legendre polynomials $P_n\left(y\right)$ are defined by the generating function

$$\begin{array}{c}\hfill {\left(\frac{1}{1-2yt+t^2}\right)}^{\frac{1}{2}}=\sum _{n=0}^{\infty }{P}_n\left(y\right)t^n.\end{array}$$

The Jacobi polynomials ${\left\{P_n^{(\alpha ,\beta )}\left(y\right)\right\}}_{0\le n<\infty }$ are defined by the generating function

$$\begin{array}{c}\hfill {\left[R{(1+R-t)}^{\alpha }{(1+R+t)}^{\beta }\right]}^{-1}=\sum _{k=0}^{\infty }{2}^{-\alpha -\beta }{P}_n^{(\alpha ,\beta )}\left(y\right)t^n,\end{array}$$

where $R=\sqrt{1-2yt+t^2}$, $\left|t\right|<1$, $\alpha ,\beta >-1$.

The Gegenbauer polynomials ${\left\{C_n^{\lambda }\left(y\right)\right\}}_{0\le n<\infty }$ are defined by the generating function

$$\begin{array}{c}\hfill {\left(\frac{1}{1-2yt+t^2}\right)}^{\lambda }=\sum _{n=0}^{\infty }{C}_n^{\lambda }\left(y\right)t^n,\left(\lambda >-\frac{1}{2}\right).\end{array}$$

It is well know that polynomials and sequence occupy indispensable positions in the research of number theory. Especially, Fibonacci and Lucas numbers, Chebyshev and Legendre polynomials and others. These polynomials and numbers are closely related and there are a variety of meaningful results which have been researched by interested scholars until now. For example, the identities of Chebyshev polynomials can be found in [1,2,3,4,5,6,7,8,9], and the contents about Fibonacci and Lucas numbers in [10,11]. Some authors have a research which connects Chebyshev polynomials and Fibonacci or Lucas polynomials (see [12,13,14]).

In particular, we can find many significant results in the aspect of studying the calculating problem of one kind sums of some important polynomials. For example, Yuankui Ma and Wenpeng Zhang have calculated one kind sums of Fibonacci Polynomials (see [15]) as follows.

Let h be a positive integer, for any integer $n\ge 0$, they proved

$$\begin{array}{c}\sum _{a_1+a_2+\cdots +a_{h+1}=n}{F}_{a_1}\left(x\right)F_{a_2}\left(x\right)\cdots F_{a_{h+1}}\left(x\right)=\frac{1}{h!}·\sum _{j=1}^h\frac{{(-1)}^{h-j}·S(h,j)}{x^{2h-j}}\hfill \\ \times \left(\sum _{i=0}^n\frac{(n-i+j)!}{(n-i)!}·\left(\genfrac{}{}{0pt}{}{2h+i-j-1}{i}\right)·\frac{{(-1)}^i·2^i·F_{n-i+j}\left(x\right)}{x^i}\right),\hfill \end{array}$$

where the summation is over all $h+1$-tuples with non-negative integer coordinates $(a_1,a_2,\cdots ,a_{h+1}$ such that $a_1+a_2+\cdots +a_{h+1}=n$, and $S(h,i)$ is a second order non-linear recurrence sequence defined by $S(h,0)=0$, $S(h,h)=1$, and $S(h+1,i+1)=2·(2h-1-i)·S(h,i+1)+S(h,i)$ for all positive integers $1\le i\le h-1$.

Yixue Zhang and Zhuoyu Chen have researched the calculating problem of one kind sums of the second kind Chebyshev polynomials (see [16]) as follows.

Let h be a positive integer, for any integer $n\ge 0$, they proved

$$\begin{array}{cc}& \sum _{a_1+a_2+\cdots +a_{h+1}=n}{U}_{a_1}\left(x\right)U_{a_2}\left(x\right)\cdots U_{a_{h+1}}\left(x\right)\hfill \\ =& \frac{1}{2^h·h!}·\sum _{j=1}^h\frac{C(h,j)}{x^{2h-j}}\sum _{i=0}^n\frac{(n-i+j)!}{(n-i)!}·\left(\genfrac{}{}{0pt}{}{2h+i-j-1}{i}\right)·\frac{U_{n-i+j}\left(x\right)}{x^i},\hfill \end{array}$$

where $C(h,i)$ is a second order non-linear recurrence sequence defined by $C(h,0)=0$, $C(h,h)=1$, $C(h+1,1)=1·3·5\cdots (2h-1)=(2h-1)!!$ and $C(h+1,i+1)=(2h-1-i)·C(h,i+1)+C(h,i)$ for all $1\le i\le h-1$.

Shimeng Shen and Li Chen have studied the calculating problem of one kind sums of Legendre Polynomials (see [17]) as follows.

For any positive integer k and integer $n\ge 0$, they proved

$$\begin{array}{cc}& (2k-1)!!\sum _{a_1+a_2+\cdots +a_{2k+1}=n}{P}_{a_1}\left(x\right)P_{a_2}\left(x\right)\cdots P_{a_k}\left(x\right)\hfill \\ =& \sum _{j=1}^{k}C(k,j)\sum _{i=0}^n\frac{(n+k+1-i-j)!}{(n-i)!}·\frac{\left(\genfrac{}{}{0pt}{}{i+j+k-2}{i}\right)}{x^{k-1+i+j}}·P_{n+k+1-i-j}\left(x\right)\hfill \end{array}$$

where $(2k-1)!!=1\times 3\times 5\cdots (2k-1)=2^k{\left(\frac{1}{2}\right)}_k$, and $C(k,i)$ is a recurrence sequence defined by $C(k,1)=1$, $C(k+1,k+1)=(2k-1)!!$ and $C(k+1,i+1)=C(k,i+1)+(k-1+i)·C(k,i)$ for all $1\le i\le k-1$.

They have converted the complex sums of $F_n\left(x\right)$ into a simple combination of $F_n\left(x\right)$, the complex sums of $U_n\left(x\right)$ into a simple combination of $U_n\left(x\right)$, and the complex sums of $P_n\left(x\right)$ into a simple combination of $P_n\left(x\right)$.

Very recently, Taekyun Kim and other people researched the properties of Fibonacci numbers through introducing the convolved Fibonacci numbers $p_n\left(x\right)$ by generating function as follows (see [18]):

$$\begin{array}{c}\hfill {\left(\frac{1}{1-t-t^2}\right)}^x=\sum _{n=0}^{\infty }{p}_n\left(x\right)\frac{t^n}{n!},(x\in \mathbf{R}).\end{array}$$

They researched some new and explicit identities of the convolved Fibonacci numbers for $x\in \mathbf{N}$. For example, for $n\ge 0$ and $r\in \mathbf{N}$, they have proved the recurrence relationship of $p_n\left(x\right)$ (see [18]):

$$\begin{array}{c}\hfill p_n\left(x\right)=\sum _{l=0}^n{p}_l\left(r\right)p_{n-l}(x-r)=\sum _{l=0}^n{p}_{n-l}\left(r\right)p_l(x-r).\end{array}$$

The convolved Fibonacci numbers $p_n\left(x\right)$ seems to be only connected with the simple power square. In fact, it can establish the relationship between polynomials and themselves, so the further research of $p_n\left(x\right)$ is very significant. They have provided us a new perspective to study the properties of some vital polynomials. For example, Taekyun Kim and other people have proved the relationship between $p_n\left(x\right)$ and the combination sums about Fibonacci numbers:

$$\begin{array}{c}\hfill \frac{p_n(r+1)}{n!}=\sum _{l_1=0}^n\sum _{l_2=0}^{n-l_1}\cdots \sum _{l_r=0}^{n-l_1-\cdots -l_{r-1}}{F}_{l_1}{F}_{l_2}\cdots F_{l_r}{F}_{n-l_1-l_2-\cdots -l_r}.\end{array}$$

They have converted the complex sums of $F_n\left(x\right)$ into a calculation problem of $p_n\left(x\right)$ and the calculation method is easier and the expression is simpler.

Inspired by this article, in this paper, for any second-order linear recurrence sequence, the generating function of which is $f\left(t\right)=\frac{1}{1+at+b{t}^2}$, we can define

$$\begin{array}{c}\hfill {\left(\frac{1}{1+at+b{t}^2}\right)}^x=\sum _{n=0}^{\infty }{p}_n\left(x\right)\frac{t^n}{n!},(a,b,x\in \mathbf{R}).\end{array}$$

(1)

Firstly, we give a specific computational formula of $p_n\left(x\right)$ for $x\in \mathbf{R}$ using the elementary methods. After that for any polynomial or sequence, the generating function of which is $f\left(t\right)=\frac{1}{1+at+b{t}^2}$, we can obtain its convolved formula easily and directly.

Secondly, if we take some special values for a, b in $f\left(t\right)$ and x in $p_n\left(x\right)$, we can find some relationship between special polynomials and themselves. For example, we will establish the relationship between the convolved Fibonacci numbers and Lucas numbers, the relationship between the convolved formula of the second kind Chebyshev polynomials and the first kind Chebyshev polynomials, and the relationship between Legendre polynomials and the first kind Chebyshev polynomials and others.

At last, through the computational formula of $p_n\left(x\right)$, especially for $x\in \mathbf{N}$, we can also convert the complex sums of $F_n$ into a liner combination of $L_n$; and express the complex sums of $U_n\left(y\right)$ as a liner combination of $T_n\left(y\right)$. More importantly, the forms are more common and the calculations are easier than previous results.

We will prove the main results as follows:

Theorem 1.

Let $f\left(t\right)=\frac{1}{1-t-t^2},$ for any integer $n\ge 0$ and $x\in \mathbf{R}$, we can obtain

$$\begin{array}{c}\hfill p_n\left(x\right)=\frac{1}{2}\sum _{i=0}^n{(-1)}^i\left(\genfrac{}{}{0pt}{}{n}{i}\right){\langle x\rangle }_i{\langle x\rangle }_{n-i}{L}_{n-2i},\end{array}$$

where ${\langle x\rangle }_n=x(x+1)(x+2)\cdots (x+n-1)$ and ${\left(x\right)}_0=1$.

Theorem 2.

Let $f\left(t\right)=\frac{1}{1-2yt+t^2},$ for any integer $n\ge 0$ and $x,y\in \mathbf{R}$, we can obtain

$$\begin{array}{c}\hfill p_n(x;y)=\sum _{i=0}^n\left(\genfrac{}{}{0pt}{}{n}{i}\right){\langle x\rangle }_i{\langle x\rangle }_{n-i}{T}_{n-2i}\left(y\right).\end{array}$$

From Theorem 1 we can deduce the following:

Corollary 1.

For any positive integer k, we have the identity

$$\begin{array}{cc}& \sum _{a_1+a_2+\cdots +a_k=n}{F}_{a_1}{F}_{a_2}\cdots F_{a_k}\hfill \\ =& \frac{1}{2{((k-1)!)}^2}\sum _{i=0}^n{(-1)}^i\frac{(k+i-1)!(k+n-i-1)!}{i!(n-i)!}·L_{n-2i}.\hfill \end{array}$$

From Theorem 2 we can deduce the following:

Corollary 2.

For any positive integer k, we have the identity

$$\begin{array}{cc}& \sum _{a_1+a_2+\cdots +a_k=n}{U}_{a_1}\left(y\right)·U_{a_2}\left(y\right)\cdots U_{a_k}\left(y\right)\hfill \\ =& \frac{1}{{((k-1)!)}^2}\sum _{i=0}^n\frac{(k+i-1)!(k+n-i-1)!}{i!(n-i)!}·T_{n-2i}\left(y\right).\hfill \end{array}$$

Corollary 3.

If $x=\frac{1}{2}$, we have the identity

$$\begin{array}{c}\hfill P_n\left(y\right)=\frac{1}{2^n}\sum _{i=0}^n\frac{(2i-1)!!(2n-2i-1)!!}{i!(n-i)!}·T_{n-2i}\left(y\right).\end{array}$$

Corollary 4.

If $x=-\frac{1}{2}$, we have the identity

$$\begin{array}{c}\hfill R=\sum _{n=0}^{\infty }\frac{1}{2^n}\sum _{i=0}^n\frac{(2i-3)!!(2n-2i-3)!!}{i!(n-i)!}·T_{n-2i}\left(y\right)·t^n.\end{array}$$

Corollary 5.

If $x=\lambda >-\frac{1}{2}$, we have the identity

$$\begin{array}{c}\hfill C_n^{\lambda }\left(y\right)=\frac{1}{n!}\sum _{i=0}^n\left(\genfrac{}{}{0pt}{}{n}{i}\right){\langle \lambda \rangle }_i{\langle \lambda \rangle }_{n-i}{T}_{n-2i}\left(y\right).\end{array}$$

Theorems 1 and 2 give the computational formula of $p_n\left(x\right)$ of some famous polynomials. Especially, we know that polynomials are closely connected and they can be converted to each other. According to these theorems, we can obtain the relationship between the polynomials easily. It cannot only extend the application of orthogonal polynomials, but also make replacement calculations according to its complexity. For example, if we make a calculation involving the Gegenbauer polynomials, for simple calculations, we can convert it into Chebyshev polynomials according to Corollary 5.

2. A Simple Lemma

In order to prove our theorems, we are going to introduce a simple lemma.

Lemma 1.

For any integer $n\ge 0$ and $a,b,x\in \mathbf{R}$, we can obtain the equation

$$\begin{array}{c}\hfill p_n\left(x\right)=\frac{1}{2}\sum _{i=0}^n{b}^i\left(\genfrac{}{}{0pt}{}{n}{i}\right){\langle x\rangle }_i{\langle x\rangle }_{n-i}\left({\left(\frac{-a+\sqrt{a^2-4b}}{2}\right)}^{n-2i}+{\left(\frac{-a-\sqrt{a^2-4b}}{2}\right)}^{n-2i}\right).\end{array}$$

Proof. 

Firstly, according Equation (1), we have

$$\begin{array}{ccc}\hfill \sum _{n=0}^{\infty }{p}_n\left(x\right)\frac{t^n}{n!}& =& {\left(\frac{1}{1+at+b{t}^2}\right)}^x={(1-\alpha t)}^{-x}{(1-\beta t)}^{-x}.\hfill \end{array}$$

(2)

We can easily know that $\alpha +\beta =-a$, $\alpha \beta =b$ and $\alpha =\frac{-a+\sqrt{a^2-4b}}{2}$, $\beta =\frac{-a-\sqrt{a^2-4b}}{2}$ are two roots of $1+at+b{t}^2=0$.

Then, applying the properties of power series, we obtain

$$\begin{array}{c}\hfill {(1-\alpha t)}^{-x}=\sum _{n=0}^{\infty }\left(\genfrac{}{}{0pt}{}{-x}{n}\right){(-1)}^n{\left(\alpha t\right)}^n=\sum _{n=0}^{\infty }\frac{{(-x)}_n}{n!}{(-1)}^n{\alpha }^n{t}^n\end{array}$$

(3)

and

$$\begin{array}{c}\hfill {(1-\beta t)}^{-x}=\sum _{n=0}^{\infty }\left(\genfrac{}{}{0pt}{}{-x}{n}\right){(-1)}^n{\left(\beta t\right)}^n=\sum _{n=0}^{\infty }\frac{{(-x)}_n}{n!}{(-1)}^n{\beta }^n{t}^n,\end{array}$$

(4)

where ${\left(x\right)}_n=x(x-1)(x-2)\cdots (x-n+1)$ and ${\left(x\right)}_0=1$.

Combining Equations (2)–(4), we get

$$\begin{array}{ccc}\hfill \sum _{n=0}^{\infty }{p}_n\left(x\right)\frac{t^n}{n!}& =& \left(\sum _{n=0}^{\infty }\frac{{(-x)}_n}{n!}{(-1)}^n{\alpha }^n{t}^n\right)\left(\sum _{n=0}^{\infty }\frac{{(-x)}_n}{n!}{(-1)}^n{\beta }^n{t}^n\right)\hfill \\ & =& \sum _{n=0}^{\infty }\left(\sum _{i=0}^n\frac{{(-x)}_i{(-1)}^i{\alpha }^i{t}^i}{i!}·\frac{{(-x)}_{n-i}{(-1)}^{n-i}{\beta }^{n-i}{t}^{n-i}}{(n-i)!}\right)\hfill \\ & =& \sum _{n=0}^{\infty }\frac{{(-1)}^n}{n!}\left(\sum _{i=0}^n\left(\genfrac{}{}{0pt}{}{n}{i}\right){(-x)}_i{(-x)}_{n-i}{\alpha }^i{\beta }^{n-i}\right)t^n.\hfill \end{array}$$

(5)

Similarly, according the symmetry of $\alpha$ and $\beta$, we can easily obtain

$$\begin{array}{c}\hfill \sum _{n=0}^{\infty }{p}_n\left(x\right)\frac{t^n}{n!}=\sum _{n=0}^{\infty }\frac{{(-1)}^n}{n!}\left(\sum _{i=0}^n\left(\genfrac{}{}{0pt}{}{n}{i}\right){(-x)}_i{(-x)}_{n-i}{\beta }^i{\alpha }^{n-i}\right)t^n.\end{array}$$

(6)

Then, combining Equations (5) and (6), we know that

$$\begin{array}{ccc}\hfill \sum _{n=0}^{\infty }{p}_n\left(x\right)\frac{t^n}{n!}& =& \frac{1}{2}\sum _{n=0}^{\infty }\frac{{(-1)}^n}{n!}\left(\sum _{i=0}^n\left(\genfrac{}{}{0pt}{}{n}{i}\right){(-x)}_i{(-x)}_{n-i}{\left(\alpha \beta \right)}^i\left({\beta }^{n-2i}+{\alpha }^{n-2i}\right)\right)t^n\hfill \\ & =& \frac{1}{2}\sum _{n=0}^{\infty }\frac{1}{n!}\left(\sum _{i=0}^n{b}^i\left(\genfrac{}{}{0pt}{}{n}{i}\right){\langle x\rangle }_i{\langle x\rangle }_{n-i}\left({\beta }^{n-2i}+{\alpha }^{n-2i}\right)\right)t^n.\hfill \end{array}$$

(7)

Comparing the coefficients of $t^n$ in Equation (7), we get

$$\begin{array}{ccc}\hfill p_n\left(x\right)& =& \frac{1}{2}\sum _{i=0}^n{b}^i\left(\genfrac{}{}{0pt}{}{n}{i}\right){\langle x\rangle }_i{\langle x\rangle }_{n-i}\left({\alpha }^{n-2i}+{\beta }^{n-2i}\right)\hfill \\ & =& \frac{1}{2}\sum _{i=0}^n{b}^i\left(\genfrac{}{}{0pt}{}{n}{i}\right){\langle x\rangle }_i{\langle x\rangle }_{n-i}\left({\left(\frac{-a+\sqrt{a^2-4b}}{2}\right)}^{n-2i}+{\left(\frac{-a-\sqrt{a^2-4b}}{2}\right)}^{n-2i}\right).\hfill \end{array}$$

Now we have completed the proof of the Lemma 1.  □

3. Proof of the Theorem

Proof of Theorem 1.

If we take $a=-1$ and $b=-1$ in Equation (1), we know that $f\left(t\right)$ is the generating function of Fibonacci number. That is,

$$\begin{array}{c}\hfill f\left(t\right)=\frac{1}{1-t-t^2}=\sum _{n=0}^{\infty }{F}_n{t}^n.\end{array}$$

The convolved Fibonacci numbers $p_n\left(x\right)$ are defined by the generating function as [18]

$$\begin{array}{c}\hfill f^x\left(t\right)={\left(\frac{1}{1-t-t^2}\right)}^x=\sum _{n=0}^{\infty }{p}_n\left(x\right)\frac{t^n}{n!}.\end{array}$$

(8)

In this time, $\alpha =\frac{1+\sqrt{5}}{2}$, $\beta =\frac{1-\sqrt{5}}{2}$.

According to the Lemma 1 and $L_n={\alpha }^n+{\beta }^n$, we can get

$$\begin{array}{ccc}\hfill p_n\left(x\right)& =& \frac{1}{2}\sum _{i=0}^n{b}^i\left(\genfrac{}{}{0pt}{}{n}{i}\right){\langle x\rangle }_i{\langle x\rangle }_{n-i}\left({\left(\frac{-a+\sqrt{a^2-4b}}{2}\right)}^{n-2i}+{\left(\frac{-a-\sqrt{a^2-4b}}{2}\right)}^{n-2i}\right)\hfill \\ & =& \frac{1}{2}\sum _{i=0}^n{b}^i\left(\genfrac{}{}{0pt}{}{n}{i}\right){\langle x\rangle }_i{\langle x\rangle }_{n-i}\left({\left(\frac{1+\sqrt{5}}{2}\right)}^{n-2i}+{\left(\frac{1-\sqrt{5}}{2}\right)}^{n-2i}\right)\hfill \\ & =& \frac{1}{2}\sum _{i=0}^n{b}^i\left(\genfrac{}{}{0pt}{}{n}{i}\right){\langle x\rangle }_i{\langle x\rangle }_{n-i}\left({\alpha }^{n-2i}+{\beta }^{n-2i}\right)\hfill \\ & =& \frac{1}{2}\sum _{i=0}^n{(-1)}^i\left(\genfrac{}{}{0pt}{}{n}{i}\right){\langle x\rangle }_i{\langle x\rangle }_{n-i}{L}_{n-2i}.\hfill \end{array}$$

(9)

In this equation, $p_n\left(x\right)$ is expressed as a combined forms of Lucas number. The Proof of Theorem 1 has finished.  □

About the convolved Fibonacci numbers $p_n\left(x\right)$, Taekyun Kim and others have obtained its some-recurrence formulae in reference [18]. Based on [18], we have given an exact computational formula of $p_n\left(x\right)$ for any arbitrary x in Theorem 1. Compared with the results in [18], Theorem 1 is more general and easier.

If we take $x=k\in \mathbf{N}$ in Equation (8), we get

$$\begin{array}{cc}& \sum _{n=0}^{\infty }{p}_n\left(k\right)\frac{t^n}{n!}={\left(\frac{1}{1-t-t^2}\right)}^k={\left(\sum _{n=0}^{\infty }{F}_n{t}^n\right)}^k\hfill \\ =& \left(\sum _{a_1=0}^{\infty }{F}_{a_1}·t^{a_1}\right)\left(\sum _{a_2=0}^{\infty }{F}_{a_2}·t^{a_2}\right)\cdots \left(\sum _{a_k=0}^{\infty }{F}_{a_k}·t^{a_k}\right)\hfill \\ =& \left(\sum _{a_1=0}^{\infty }\sum _{a_2=0}^{\infty }\cdots \sum _{a_k=0}^{\infty }{F}_{a_1}·F_{a_2}\cdots F_{a_k}·t^{a_1+a_2\cdots +a_k}\right)\hfill \\ =& \sum _{n=0}^{\infty }\left(\sum _{a_1+a_2+\cdots +a_k=n}{F}_{a_1}·F_{a_2}\cdots F_{a_k}\right)·t^n,\hfill \end{array}$$

and then combining Equation (9), we can obtain

$$\begin{array}{cc}& \sum _{a_1+a_2+\cdots +a_k=n}{F}_{a_1}·F_{a_2}\cdots F_{a_k}\hfill \\ =& \frac{1}{2n!}\sum _{i=0}^n{(-1)}^i\left(\genfrac{}{}{0pt}{}{n}{i}\right){\langle k\rangle }_i{\langle k\rangle }_{n-i}{L}_{n-2i}\hfill \\ =& \frac{1}{2{((k-1)!)}^2}\sum _{i=0}^n{(-1)}^i\frac{(k+i-1)!(k+n-i-1)!}{i!(n-i)!}{L}_{n-2i}.\hfill \end{array}$$

The proof of Corollary 1 has finished.

For every $F_{a_l}(1\le l\le k)$, ${\sum }_{a_1+a_2+\cdots +a_k=n}{F}_{a_1}·F_{a_2}\cdots F_{a_k}$ is symmetry.

Proof of Theorem 2.

If we take $a=-2y$ and $b=1$ in Equation (1), we all know $f(t;y)$ is the generating function of the second-kind Chebyshev polynomials $U_n\left(y\right)$

$$\begin{array}{c}\hfill f(t;y)=\frac{1}{1-2yt+t^2}=\sum _{n=0}^{\infty }{U}_n\left(y\right)t^n.\end{array}$$

The convolved second-kind Chebyshev polynomials $p_n(x;y)$ are defined by the generating function as [18]

$$\begin{array}{c}\hfill f^x(t;y)={\left(\frac{1}{1-2yt+t^2}\right)}^x=\sum _{n=0}^{\infty }{p}_n(x;y)\frac{t^n}{n!}.\end{array}$$

(10)

In this time, $\alpha =y+\sqrt{y^2-1}$, $\beta =y-\sqrt{y^2-1}$.

According to the Lemma 1 and $T_n\left(y\right)=\frac{1}{2}({\alpha }^n+{\beta }^n)$, we can get

$$\begin{array}{c}\hfill p_n(x;y)=\sum _{i=0}^n\left(\genfrac{}{}{0pt}{}{n}{i}\right){\langle x\rangle }_i{\langle x\rangle }_{n-i}{T}_{n-2i}\left(y\right).\end{array}$$

(11)

In this equation, $p_n(x;y)$ is expressed as a combined form of the first-kind Chebyshev polynomials $T_n\left(x\right)$.  □

If we take $x=k\in \mathbf{N}$ in Equation (10), and combining Equation (11) we can easily prove the Corollary 2.

Take $x=\frac{1}{2}$ in Equation (10), we know $f^{\frac{1}{2}}(t;y)$ is the generating function of the Legendre polynomials $P_n\left(x\right)$ as follows:

$$\begin{array}{c}\hfill f^{\frac{1}{2}}\left(t\right)={\left(\frac{1}{1-2yt+t^2}\right)}^{\frac{1}{2}}=\sum _{n=0}^{\infty }{P}_n\left(y\right)t^n=\sum _{n=0}^{\infty }{p}_n\left(\frac{1}{2};y\right)\frac{t^n}{n!}.\end{array}$$

According to Theorem 2, we can easily obtain

$$\begin{array}{ccc}\hfill p_n\left(\frac{1}{2};y\right)& =& \sum _{i=0}^n\left(\genfrac{}{}{0pt}{}{n}{i}\right){〈\frac{1}{2}〉}_i{〈\frac{1}{2}〉}_{n-i}{T}_{n-2i}\left(y\right)\hfill \\ & =& \frac{1}{2^{2n}}\sum _{i=0}^n\frac{n!\left(2i\right)!\left(2\right(n-i\left)\right)!}{{(i!)}^2{((n-i)!)}^2}·T_{n-2i}\left(y\right)\hfill \\ & =& \frac{n!}{2^n}\sum _{i=0}^n\frac{(2i-1)!!(2n-2i-1)!!}{i!(n-i)!}·T_{n-2i}\left(y\right).\hfill \end{array}$$

In a word, we know the Legendre polynomials $P_n\left(x\right)$ can be expressed as combined forms of the first kind Chebyshev polynomials $T_n\left(x\right)$ as follows:

$$\begin{array}{c}\hfill P_n\left(y\right)=\frac{1}{2^n}\sum _{i=0}^n\frac{(2i-1)!!(2n-2i-1)!!}{i!(n-i)!}·T_{n-2i}\left(y\right).\end{array}$$

The proof of Corollary 3 has finished.

If we take $x=-\frac{1}{2}$ in (10), then we can easily obtain

$$\begin{array}{ccc}\hfill R& =& \sum _{n=0}^{\infty }p(-\frac{1}{2};y)\frac{t^n}{n!}=\sum _{n=0}^{\infty }\frac{1}{2^{2n-2}}\sum _{i=0}^n\frac{\left(2\right(i-1\left)\right)!\left(2\right(n-i-1\left)\right)!}{i!(i-1)!(n-i)!(n-i-1)!}·T_{n-2i}\left(y\right)·t^n\hfill \\ & =& \sum _{n=0}^{\infty }\frac{1}{2^n}\sum _{i=0}^n\frac{(2i-3)!!(2n-2i-3)!!}{i!(n-i)!}·T_{n-2i}\left(y\right)·t^n.\hfill \end{array}$$

The proof of Corollary 4 has finished.

Taking $x=\lambda >-\frac{1}{2}$ in Equation (10), we know $f^{\lambda }(t;y)$ is the generating function of the Gegenbauer polynomials ${\left\{C_n^{\lambda }\left(y\right)\right\}}_{0\le n<\infty }$ as follows:

$$\begin{array}{c}\hfill {\left(\frac{1}{1-2yt+t^2}\right)}^{\lambda }=\sum _{n=0}^{\infty }{C}_n^{\lambda }\left(y\right)t^n=f^{\lambda }(t;y)=\sum _{n=0}^{\infty }{p}_n\left(\lambda ;y\right)\frac{t^n}{n!}.\end{array}$$

According to Theorem 2, we can easily obtain

$$\begin{array}{c}\hfill p_n\left(\lambda ;y\right)=\sum _{i=0}^n\left(\genfrac{}{}{0pt}{}{n}{i}\right){\langle \lambda \rangle }_i{\langle \lambda \rangle }_{n-i}{T}_{n-2i}\left(y\right).\end{array}$$

The proof of Corollary 5 has finished.