1. Introduction and Results
Let
be an integer, the Fibonacci polynomials
are defined by the second-order linear recurrence sequence
with initial conditions
,
.
The generating function of the Fibonacci polynomials is given by
In particular, for
are the famous Fibonacci numbers. These polynomials and numbers play extremely vital roles in the mathematical theories and applications and a significant amount of research has been carried out to obtain a variety of meaningful results by several authors (see [
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15]). For example, Yuan Yi and Wenpeng Zhang (see [
16]) researched the computational problem of the summation:
Yuankui Ma and Wenpeng Zhang (see [
17]) acquired a different expression about the summation by introducing a new second order non-linear recursive sequence.
In [
18], Taekyun Kim and others studied the properties of Fibonacci numbers by introducing the convolved Fibonacci numbers
, which are given by the generating function
The authors gave a new formula for calculating by the elementary and combinatorial methods, and obtained some new and explicit identities of the convolved Fibonacci numbers, including the relationship between and the combination sums about Fibonacci numbers.
In this paper, we consider the Tetranacci numbers
(see [
19]), which are defined by the fourth-order linear recurrence relation
with
.
It is obvious that
The Tetranacci numbers can be extended to negative index n arising from the rearranged recurrence relation
which yields the sequence of “nega-Tetranacci” numbers,
The generating function of the Tetranacci sequences is given by
Tetranacci numbers have important applications in combinatorial counting and graph theory, W. Marcellus E (see [
20,
21]) studied the arithmetical properties of
, Rusen Li (see [
22]) obtained some convolution identities for
. Moreover, the summation calculation for different sequences is one of the hot topics in number theory, and many scholars have obtained a series of interesting results (see [
23,
24]). Therefore, it is very meaningful to further study the properties of the Tetranacci sequences. Inspired by the above references, for a real number
, we can define a new function
, which is given by
The main purpose of this paper is to study the relationship between
and
, and to prove some computational formulas of the fourth-order recurrence sequence by applying the elementary method and the symmetry properties of the summation processes. That is, we shall prove the following:
Theorem 1. For a real numberand any integerwe havewheredenotes the summation over all four-dimensional nonnegative integer coordinatessuch that, and,for all positive integers n. According to this theorem, we can obtain the following corollaries:
Corollary 1. For any integerwe have Corollary 2. For any integerand, we have Corollary 3. For any integer, we havewhere the double factorial is defined asfor even positive integers andfor odd positive integers. Corollary 4. For any integer, we have>
2. Several Simple Lemmas
To complete the proof of the theorem, we need the following two simple lemmas, which are essential to prove our main results.
Lemma 1. For any integer, we havewhereandare the four roots of the equation. Proof. It is obvious that
can be expressed the formula
Since
, so we can get the system of equations
On the other hand, we observe that , , and .
It is clear that the Equation (
3) implies
Then note that (4) can also be written as
Hence, by (2) and (5), we immediately obtain
Now we have completed the proof of Lemma 1. □
Lemma 2. For a real numberand any integerwe have Proof. For any non-negative integers
and
d, we have
where
go through permutations of
. □
Observe that the non-negative integers coordinates
with
is symmetrical, then we can obtain
On the other hand, we have
Then, applying (6) and (7), we obtain Lemma 2.
3. Proofs of the Main Results
In this section, we will prove our theorem and corollaries.
For any real number
, applying the properties of power series, we have
we note that
and
satisfy
, so
Then combining (8) and Lemma 1 and 2, we can obtain
This completes the proof of Theorem 1.
Since and , according to Theorem 1, we can easily obtain Corollary 1.
If we take
in (1), we have
and then by Theorem 1, we can obtain
This completes the proof of Corollary 2.
If we take
and
in Theorem 1, since
we can immediately deduce Corollary 3 and Corollary 4.