Next Article in Journal
Combination Effect of Baffle Arrangement and Hybrid Nanofluid on Thermal Performance of a Shell and Tube Heat Exchanger Using 3-D Homogeneous Mixture Model
Previous Article in Journal
Markov Chain K-Means Cluster Models and Their Use for Companies’ Credit Quality and Default Probability Estimation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Central and Local Limit Theorems for Numbers of the Tribonacci Triangle

Institute of Data Science and Digital Technologies, Vilnius University, LT-04812 Vilnius, Lithuania
Mathematics 2021, 9(8), 880; https://doi.org/10.3390/math9080880
Submission received: 17 March 2021 / Revised: 10 April 2021 / Accepted: 14 April 2021 / Published: 16 April 2021

Abstract

:
In this research, we continue studying limit theorems for combinatorial numbers satisfying a class of triangular arrays. Using the general results of Hwang and Bender, we obtain a constructive proof of the central limit theorem, specifying the rate of convergence to the limiting (normal) distribution, as well as a new proof of the local limit theorem for the numbers of the tribonacci triangle.

1. Introduction

The tribonacci triangle (also known as the Delannoy triangle [1], cf. OEIS Number sequence A008288 [2]) was introduced to derive the expansion of the tribonacci numbers (OEIS Number sequence A000073 [3]). The sum of the elements along a rising diagonal of this triangle (see Table 1) equals the tribonacci number: 1 , 1 , 2 , 4 , 7 , 13 , 24 , .
Numbers satisfying the triangle can be defined by the following recurrent expression:
T n , k = 1 , for   k = 0   or   k = n , 0 , for   n < k   or   n < 0   or   k < 0 , T n 1 , k 1 + T n 1 , k + T n 2 , k 1 , otherwise .
Barry [4] showed that the closed form for numbers satisfying the tribonacci triangle is
T n , k = j = 0 min ( k , n k ) C k j C n j k .
The tribonacci (Delannoy)-like triangles and their generalizations are intensively examined nowadays. Amrouche, Belbachir and Ramírez [1,5] have studied the unimodality of sequences located in the triangle’s infinite transversals and derived the explicit formulation of the linear recurrence sequence satisfied by the sum of the elements lying over any finite ray of the generalized tribonacci matrix. Kuhapatanakul [6] has examined the connection between a generalized tribonacci triangle and a generalized Fibonacci sequence. The total positivity of Delannoy-like triangles has been considered by Mu and Zheng [7]. Yang, Zheng and Yuan [8] have studied the inverses of the generalized Delannoy matrices.
The present research extends the investigations of the asymptotics for Delannoy numbers undertaken by Noble [9,10] and Wang, Zheng and Chen [11] (as well as our research into central and local limit theorems for combinatorial numbers satisfying a class of triangular arrays [12,13,14,15]). Noble has obtained asymptotic expansions for the central weighted Delannoy numbers ( u r , r ) and the numbers along the the diagonal with slope 2 ( u r , 2 r ). Wang, Zheng and Chen showed the asymptotic normality of Delannoy numbers, using the properties of the zeroes of Delannoy polynomials. In this work we provide a new constructive proof of the central limit theorem for the numbers of the tribonacci triangle, specifying the rate of convergence to the limiting distribution (in the process we receive the closed exact expression for the variance of the random variable, associated to the numbers of the tribonacci triangle, missing in the work of Wang et al.), together with a new proof of the local limit theorem.
The paper is organized in the following way. The first part is the introduction. In the second part, we specify the moment-generating function of the numbers of the tribonacci triangle and calculate exact expressions for the expectation and the variance of the random variable, associated to the numbers of the tribonacci triangle. The third and fourth sections are devoted to the central and local limit theorems.
Throughout this paper, we denote by Φ μ , σ ( x ) the cumulative distribution function of the normal distribution with the mean μ and the standard deviation σ ; by φ μ , σ ( x ) we denote the corresponding density function.
All limits in the paper, unless specified, are taken as n .

2. Moment-Generating Function

Let us consider the generating function of the numbers given by Equation (1),
G ( x , y ) = n = 0 k = 0 T n , k x n y k = n = 0 k = 0 n T n , k x n y k .
Lemma 1.
(Alladi and Hoggatt [16]). The bivariate generating function of the numbers of the tribonacci triangle is
G ( x , y ) = 1 1 x x y x 2 y .
Let A n be an integral random variable with the probability mass function
P ( A n = k ) = T n , k k = 0 n T n , k .
The moment-generating function of the random variable A n equals
M n ( s ) = E ( e A n s ) = k = 0 n P ( A n = k ) e k s = S n 1 k = 0 n T n , k e k s ,
where S n stands for the sum of the n-th row of the triangle,
S n = k = 0 n T n , k .
Combining the definition of the generating function from Equations (2) and (5), we obtain
G ( x , e s ) = n = 0 x n k = 0 n T n , k e s k = n = 0 x n S n M n ( s ) .
Thus, the partial differentiation of the generating function G ( x , y ) at x = 0 , yields us the moment-generating function
M n ( s ) = 1 S n n ! n x n G ( x , e s ) x = 0 .
Note that, since M n ( 0 ) = 1 , we have a formula for the sum of the n-th row,
S n = 1 n ! n x n G ( x , 1 ) x = 0 .
Lemma 2.
The moment-generating function of the random variable A n , associated to the numbers of the tribonacci triangle given by Equation (4), is
M n ( s ) = 8 θ ( s ) ( 1 + e s + θ ( s ) ) n + 1 ( 1 + e s θ ( s ) ) n + 1 ( 2 + 8 ) n + 1 ( 2 8 ) n + 1 ,
here
θ ( s ) = e 2 s + 6 e s + 1 , s R .
Proof. 
Let us consider the denominator of G ( x , e s ) from Equation (3),
1 ( 1 + e s ) x e s x 2 = e s ( x 2 + ( 1 + e s ) x e s ) = e s ( x x 1 ) ( x x 2 ) ,
where
x 1 = r 1 ( s ) = ( 1 + e s ) + e s θ ( s ) 2 , x 2 = r 2 ( s ) = ( 1 + e s ) e s θ ( s ) 2 .
Next,
n x n 1 ( x x 1 ) ( x x 2 ) x = 0 = 1 x 1 x 2 n x n 1 x x 1 n x n 1 x x 2 x = 0 = ( 1 ) n n ! x 1 x 2 1 ( x x 1 ) n + 1 1 ( x x 2 ) n + 1 x = 0 = n ! x 2 x 1 x 2 n + 1 x 1 n + 1 ( x 1 x 2 ) n + 1 .
Now, using Equation (11), we calculate the n-th derivative of G ( x , e s ) ,
n x n G ( x , e s ) x = 0 = n ! ( 1 + e s + θ ( s ) ) n + 1 ( 1 + e s θ ( s ) ) n + 1 2 n + 1 θ ( s ) .
Thus, by Equation (7),
S n = ( 2 + 8 ) n + 1 ( 2 8 ) n + 1 2 n + 1 8 ,
yielding us the statement of the lemma (cf. Equation (6)). □
Lemma 3.
The expectation and the variance of the random variable A n , associated to the numbers of the tribonacci triangle from Equation (4), are
μ n = n 2 , σ n 2 = n 2 8 + 2 1 8 ,
respectively.
Proof. 
By Equation (8), the first and second derivatives of the moment-generating function are
M n ( s ) = ( 1 + e s + θ ( s ) ) n ( e s + θ ( s ) ) ( 1 + e s θ ( s ) ) n ( e s θ ( s ) ) ( 8 ( n + 1 ) ) 1 ( ( 2 + 8 ) n + 1 ( 2 8 ) n + 1 ) θ ( s ) 8 θ 2 ( s ) ( ( 1 + e s + θ ( s ) ) n + 1 ( 1 + e s θ ( s ) ) n + 1 ) θ ( s ) ( 2 + 8 ) n + 1 ( 2 8 ) n + 1
and
M n ( s ) = n ( 1 + e s + θ ( s ) ) n 1 ( e s + θ ( s ) ) 2 + ( 1 + e s + θ ( s ) ) n ( e s + θ ( s ) ) ( 8 ( n + 1 ) ) 1 ( ( 2 + 8 ) n + 1 ( 2 8 ) n + 1 ) θ ( s ) ( ( 1 + e s + θ ( s ) ) n ( e s + θ ( s ) ) ( 1 + e s θ ( s ) ) n ( e s θ ( s ) ) ) θ ( s ) ( 8 ( n + 1 ) ) 1 ( ( 2 + 8 ) n + 1 ( 2 8 ) n + 1 ) θ 2 ( s ) n ( 1 + e s θ ( s ) ) n 1 ( e s θ ( s ) ) 2 + ( 1 + e s θ ( s ) ) n ( e s θ ( s ) ) ( 8 ( n + 1 ) ) 1 ( ( 2 + 8 ) n + 1 ( 2 8 ) n + 1 ) θ ( s ) ( n + 1 ) ( 1 + e s + θ ( s ) ) n ( e s + θ ( s ) ) θ ( s ) + ( 1 + e s + θ ( s ) ) n + 1 θ ( s ) ( 8 ) 1 ( ( 2 + 8 ) n + 1 ( 2 8 ) n + 1 ) θ 2 ( s ) + 2 ( 1 + e s + θ ( s ) ) n + 1 ( θ ( s ) ) 2 2 ( 1 + e s θ ( s ) ) n + 1 ( θ ( s ) ) 2 ( 8 ) 1 ( ( 2 + 8 ) n + 1 ( 2 8 ) n + 1 ) θ 3 ( s ) + ( n + 1 ) ( 1 + e s θ ( s ) ) n ( e s θ ( s ) ) θ ( s ) + ( 1 + e s θ ( s ) ) n + 1 θ ( s ) ( 8 ) 1 ( ( 2 + 8 ) n + 1 ( 2 8 ) n + 1 ) θ 2 ( s )
Note that (cf. Equation (9))
θ ( s ) = e 2 s + 3 e s ( e 2 s + 6 e s + 1 ) 1 / 2 = e 2 s + 3 e s θ ( s ) , θ ( s ) = e 4 s + 9 e 3 s + 11 e 2 s + 3 e s ( e 2 s + 6 e s + 1 ) 3 / 2 = e 4 s + 9 e 3 s + 11 e 2 s + 3 e s θ 3 ( s ) ,
hence,
θ ( 0 ) = 2 , θ ( 0 ) = 3 2 4 .
Next, calculating the expectation, by Equations (12) and (14), we obtain
μ n = M n ( 0 ) = ( n + 1 ) ( 2 + 8 ) n ( 1 + 2 ) ( 2 8 ) n ( 1 2 ) ( 2 + 8 ) n + 1 ( 2 8 ) n + 1 1 2 = ( n + 1 ) 2 n ( 1 + 2 ) n + 1 2 n ( 1 2 ) n + 1 2 n + 1 ( 1 + 2 ) n + 1 2 n + 1 ( 1 2 ) n + 1 1 2 = n 2 ,
yielding us the first statement of the lemma.
Calculating the variance (cf. Equations (13) and (15)), we obtain
σ n 2 = M n ( 0 ) μ n 2 = n ( 2 + 8 ) n 1 ( 1 + 2 ) 2 n ( 2 8 ) n 1 ( 1 2 ) 2 ( n + 1 ) 1 ( ( 2 + 8 ) n + 1 ( 2 8 ) n + 1 ) + ( 2 + 8 ) ) n ( 1 + 3 2 / 4 ) ( 2 8 ) ) n ( 1 3 2 / 4 ) ( n + 1 ) 1 ( ( 2 + 8 ) n + 1 ( 2 8 ) n + 1 ) ( 2 + 8 ) ) n ( 1 + 2 ) ( 2 8 ) ) n ( 1 2 ) 2 ( n + 1 ) 1 ( ( 2 + 8 ) n + 1 ( 2 8 ) n + 1 ) ( n + 1 ) ( 2 + 8 ) n ( 1 + 2 ) 2 ( n + 1 ) ( 2 8 ) n ( 1 2 ) 2 8 ( ( 2 + 8 ) n + 1 ( 2 8 ) n + 1 ) + 1 2 ( 2 + 8 ) n + 1 3 2 / 4 ( 2 8 ) n + 1 3 2 / 4 8 ( ( 2 + 8 ) n + 1 ( 2 8 ) n + 1 ) n 2 4 = n ( n + 1 ) 4 n + 1 4 n + 1 4 + 1 2 3 8 n 2 4 + ( 2 + 8 ) ) n ( 2 + 8 + 2 + 2 ) ( 2 8 ) ) n ( 2 8 + 2 2 ) 4 ( n + 1 ) 1 ( ( 2 + 8 ) n + 1 ( 2 8 ) n + 1 ) = n 4 3 8 + n + 1 4 1 + 1 2 = n + 1 4 2 1 8 = n 2 8 + 2 1 8 ,
thus concluding the proof of the lemma. □

3. Central Limit Theorem

Let, by Hwang [17], Ω n be a sequence of integral random variables, and
M n ( s ) = e H n ( s ) 1 + O κ n 1 .
Here O-term is uniform for | s | τ , s C , τ > 0 , and
(i)
H n ( s ) = u ( s ) ϕ ( n ) + v ( s ) , with u ( s ) and v ( s ) analytic for | s | τ and independent of n, u ( 0 ) 0 ;
(ii)
ϕ ( n ) + ;
(iii)
κ n + .
We apply the following Hwang’s result [17] to prove the central limit theorem for the numbers of Equation (1) and specify the rate of convergence to the limiting distribution.
Theorem 1.
(Hwang). Under assumptions (i)–(iii),
P Ω n u ( 0 ) ϕ ( n ) u ( 0 ) ϕ ( n ) < x Φ ( x ) = O 1 κ n + 1 ϕ ( n ) ,
uniformly with respect to x, x R .
Next we prove an auxiliary lemma.
Lemma 4.
For x R ,
1 3 + 8 1 + e x θ ( x ) 1 + e x + θ ( x ) < 0 .
Proof. 
Let
q ( x ) = 1 + e x θ ( x ) 1 + e x + θ ( x ) .
Calculating the first derivative, we obtain
q ( x ) = 2 e x θ ( x ) 2 θ ( x ) 2 e x θ ( x ) ( 1 + e x + θ ( x ) ) 2 .
Solving the equation
e x θ ( x ) θ ( x ) e x θ ( x ) = 0 ,
we get
θ 2 ( x ) e 2 x 4 e x 3 = 0 e x = 1 ,
yielding us the stationary point x 0 = 0 . Since q ( x 0 ) = 1 / ( 8 + 6 2 ) > 0 , we have min q ( x ) = q ( x 0 ) = 1 / ( 3 + 8 ) , thus concluding the proof.
The following theorem shows that the numbers of the tribonacci triangle from Equation (1) are asymptotically normal, and identifies the rate of convergence to the limiting distribution.
Theorem 2.
Suppose that F n ( x ) is the cumulative distribution function of the random variable A n , then
F n x μ n σ n Φ ( x ) = O 1 n ,
uniformly with respect to x, x R .
Proof. 
The logarithm of the moment-generating function equals
log M n ( s ) = n = ϕ ( n ) log 1 + e s + θ ( s ) 2 + 8 = u ( s ) + log 1 + e s + θ ( s ) 2 + 8 + log 8 θ ( s ) = v ( s ) + log 1 1 + e s θ ( s ) 1 + e s + θ ( s ) n + 1 = O 1 + e s θ ( s ) 1 + e s + θ ( s ) n + 1 log 1 2 8 2 + 8 n + 1 = O 2 8 2 + 8 n + 1 .
By Lemma 4,
1 + e s θ ( s ) 1 + e s + θ ( s ) 2 8 2 + 8 = 1 3 + 8 < 1 .
Thus,
M n ( s ) = exp u ( s ) ϕ ( n ) + v ( s ) 1 + O κ n 1 ) .
Here κ n = ( 3 + 8 ) n + 1 . Note that the functions u ( s ) , v ( s ) , ϕ ( n ) and κ n satisfy the conditions (i)–(iii). Indeed,
u ( s ) = e s + θ ( s ) 1 + e s + θ ( s ) , u ( s ) = ( e s + θ ( s ) ) ( 1 + e s + θ ( s ) ) ( e s + θ ( s ) ) 2 ( 1 + e s + θ ( s ) 2 ) .
Hence,
u ( 0 ) = 1 2 , u ( 0 ) = 2 8 0 ,
yielding us, by Equation (16), the statement of the theorem. □

4. Local Limit Theorem

We apply a general local limit theorem, based on the nature of the bivariate generating function of Equations (2) and (3).
Theorem 3.
(Bender [18]) Let f ( z , w ) have a power series expansion
f ( z , w ) = n , k 0 u n , k z n w k
with non-negative coefficients and let a < b be real numbers. Define
R ( ε ) = z : a z b , | z | ε .
Suppose there exists ε > 0 , δ > 0 , a non-negative integer m, and functions A ( s ) , r ( s ) such that
(i)
an A ( s ) is continuous and non-zero for s R ( ε ) ,
(ii)
an r ( s ) is non-zero and has a bounded third derivative for s R ( ε ) ,
(iii)
for s R ( ε ) and | z | | r ( s ) | ( 1 + δ ) function
1 z r ( s ) m f ( z , e s ) A ( s ) 1 z / r ( s )
is analytic and bounded,
(iv)
( r ( α ) / r ( α ) ) 2 r ( α ) / r ( α ) 0 for a α b ,
(v)
f ( z , e s ) is analytic and bounded for
| z | | r ( s ) | ( 1 + δ ) , ε | s | π .
Then we have
u n , k n m e α k A ( α ) m ! r n ( α ) ϑ α 2 π n
uniformly for a α b , where
k n = r ( α ) r ( α ) , ϑ α 2 = k n 2 r ( α ) r ( α ) .
Now we can proceed with the local limit theorem for the numbers of the tribonacci triangle.
Theorem 4.
Let
μ n = n 2 , σ ^ n 2 = n 2 8 ,
then for all k, such that
| k μ n | = o ( σ ^ n 4 / 3 ) ,
we have the following asymptotic expression for the numbers of the tribonacci triangle in Equation (1),
T n , k ( 1 + 2 ) n + 1 2 2 φ μ n , σ ^ n ( k ) .
Proof. 
By Lemma 1, the generating function is
f ( z , e s ) = 1 1 z z e s z 2 e s .
Let r ( s ) (cf. Theorem 3) be a root of the function
h ( z , e s ) = 1 z z e s z 2 e s = ( e s z 2 + ( e s + 1 ) z 1 ) .
This function has two roots (cf. Equation (10)),
z 1 = r 1 ( s ) , z 2 = r 2 ( s ) .
Calculating derivatives, we obtain
r 1 ( s ) = 1 + θ ( s ) θ ( s ) 2 e s = θ ( s ) 3 e s 1 2 e s θ ( s ) , r 2 ( s ) = 1 θ ( s ) + θ ( s ) 2 e s = θ ( s ) + 3 e s + 1 2 e s θ ( s ) .
Note that by Theorem 1 (Bender [18]), the mean μ n = n μ and μ = r ( 0 ) / r ( 0 ) . Let r ( s ) = r 1 ( s ) . Now we have
r ( s ) r ( s ) = θ ( s ) 3 e s 1 ( θ ( s ) e s 1 ) θ ( s ) , r ( 0 ) r ( 0 ) = 1 2 ,
and
r ( s ) r ( s ) = 3 e 3 s + 11 e 2 s + 9 e s + 1 θ 3 ( s ) ( θ ( s ) e s 1 ) θ 3 ( s ) , r ( 0 ) r ( 0 ) = 2 2 8 .
Next, consider the function A ( s ) (cf. Equation (17)) as the limit
A ( s ) = lim z r ( s ) f ( z , e s ) 1 z r ( s ) m + 1 .
Here m + 1 is the order of the pole. Note that, if the pole is simple, then m = 0 . Now we obtain
A ( s ) = lim z r ( s ) 1 e s z 2 + ( e s + 1 ) z 1 1 z r ( s ) = e s lim z r 1 ( s ) r 1 ( s ) z ( z r 2 ( s ) ) ( z r 1 ( s ) ) r 1 ( s ) = 1 r ( s ) θ ( s ) .
The function at Equation (17),
1 z r ( s ) m f ( z , e s ) A ( s ) 1 z / r ( s ) = θ ( s ) + e s ( z r 2 ( s ) ) e s ( z r 2 ( s ) ) ( z r 1 ( s ) ) θ ( s ) = 1 ( z r 2 ( s ) ) θ ( s )
is analytic and bounded for
| s | < ε , | z | < | r ( 0 ) | + δ = 1 + 2 + δ .
Hence, conditions (i)–(iii) and (v) of Theorem 3 are satisfied. We check the condition (iv) evaluating ( r ( α ) / r ( α ) ) 2 r ( α ) / r ( α ) . Using Equations (21) and (22), we obtain
r ( α ) r ( α ) 2 r ( α ) r ( α ) = 4 e α ( e 3 α + 5 e 2 α + 5 e α + 1 θ ( α ) ( e α + 1 ) 2 ) θ 3 ( α ) ( θ ( α ) e α 1 ) 2 = 4 e α ( e α + 1 ) ( e 2 α + 4 e α + 1 θ ( α ) ( e α + 1 ) ) θ 3 ( α ) ( θ ( α ) e α 1 ) 2 > 0 .
Indeed, we have
e 2 α + 4 e α + 1 > θ ( α ) ( e α + 1 ) ,
since
( C + 1 ) 2 > ( C + 2 e α + 1 ) = θ 2 ( α ) ( C 2 e α + 1 ) .
Here C = e 2 α + 4 e α .
We obtain the parameter α by solving the equation
r ( α ) r ( α ) = k n .
By Equation (21), we have
1 + 3 e α θ ( α ) θ 2 ( α ) ( e α + 1 ) θ ( α ) = k n ,
1 + 3 e α ( 1 + 6 e α + e 2 α ) k n 2 = 1 ( e α + 1 ) k n 2 ( 1 + 6 e α + e 2 α ) ,
and
2 e α ( ρ ρ 2 ) ( e 2 α + 6 e α + 1 ) = 0 .
Here ρ = k / n . Hence, Equation (24) is equivalent to
e 2 α + 2 3 1 ρ ρ 2 e α + 1 = 0 .
Thus,
e α = 1 ρ ρ 2 3 1 ρ ρ 2 3 2 1 , k / n 1 / 2 , 1 ρ ρ 2 3 + 1 ρ ρ 2 3 2 1 , k / n > 1 / 2 ,
and
τ = e α = 1 ρ ρ 2 3 + 2 ρ 1 ρ ρ 2 2 ρ 2 2 ρ + 1 .
Note that 1 / ( ρ ρ 2 ) 4 . Next, combining Equations (18), (22) and (23), we get
T n , k e α k r n + 1 ( α ) θ ( α ) k 2 n 2 3 e 3 α + 11 e 2 α + 9 e α + 1 θ 3 ( α ) ( θ ( α ) e α 1 ) θ 3 ( α ) 2 π n = 2 n + 1 τ n k + 1 2 π n ( θ ( log τ ) τ 1 ) n + 1 k 2 n 2 θ 2 ( log τ ) ( τ + 1 ) 2 2 τ 3 + τ 2 9 τ 1 2 θ ( log τ ) = ( 2 1 ) n 1 2 4 2 π n Θ n , k ( 2 2 2 ) n τ n k ( θ ( log τ ) ( τ + 1 ) ) n = δ n , k .
Here
Θ n , k = 2 2 4 ( 2 1 ) τ ( θ ( log τ ) τ 1 ) k 2 n 2 θ 2 ( log τ ) ( τ + 1 ) 2 θ ( log τ ) + ( τ 3 + τ 2 9 τ 1 ) 2 θ ( log τ ) .
Note that by Equations (19) and (20), we have
k n 1 2 = o 1 n 3 ,
hence k / n 1 / 2 and τ 1 , while n . Thus, Θ n , k 1 .
Assume
x = k μ n σ ^ n .
Using Equation (19), we get
ρ = k n = 1 2 + x 2 2 4 n .
Thus, substituting the result into Equation (26) yields
| x | = o ( n 6 ) .
Next, consider the logarithm of δ n , k from Equation (25),
log δ n , k = n log ( 2 2 2 ) + n 2 1 x n 2 4 log τ n log ( θ ( log τ ) τ 1 ) .
Using Taylor series expansions, we obtain for large enough n,
τ = 1 + 4 x 2 2 4 n + 4 x 2 2 n + O x 3 n n , log τ = 4 x 2 2 4 n + O x 3 n n , θ ( log τ ) = 2 2 1 + 2 x 2 2 4 n + 3 x 2 2 2 n + O x 3 n n .
Substituting Equation (29) into Equation (28), we obtain
log δ n , k = n log ( 2 2 2 ) + n 2 1 x n 2 4 4 x 2 2 4 n + O x 3 n n n log ( 2 2 1 + 2 x 2 2 4 n + 3 x 2 2 2 n + O x 3 n n 1 4 x 2 2 4 n 4 x 2 2 n O x 3 n n 1 ) = x 2 4 n x 2 + O x 3 n n log 1 + 2 x 2 2 4 n + ( 3 2 4 ) x 2 ( 2 2 2 ) 2 n + O x 3 n n .
By multiplying factors and combining like terms after applying Taylor series expansion for logarithms, we obtain
log δ n , k = x 2 2 + o ( 1 ) ,
which, combined with Equations (25) and (27), yields us the statement of the theorem. □

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The author would like to thank the anonymous reviewer for the careful reading of the manuscript and providing constructive comments and suggestions, which have helped to improve the quality of the paper.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Amrouche, S.; Belbachir, H. Unimodality and linear recurrences associated with rays in the Delannoy triangle. Turk. J. Math. 2020, 44, 118–130. [Google Scholar] [CrossRef]
  2. Square Array of Delannoy Numbers D(i,j) (i ⩾ 0, j ⩾ 0) Read by Antidiagonals. OEIS Number Sequence A008288. The Online Encyclopedia of Integer Sequences. Available online: https://oeis.org/A008288 (accessed on 15 April 2021).
  3. Tribonacci Numbers: a(n) = a(n − 1) + a(n − 2) + a(n − 3) for n ⩾ 3 with a(0) = a(1) = 0 and a(2) = 1. OEIS Number Sequence A000073. The Online Encyclopedia of Integer Sequences. Available online: https://oeis.org/A000073 (accessed on 15 April 2021).
  4. Barry, P. On integer-sequence-based constructions of generalized Pascal triangles. J. Integer Seq. 2006, 9, 06.2.4. [Google Scholar]
  5. Amrouche, S.; Belbachir, H.; Ramírez, J.L. Unimodality, linear recurrences and combinatorial properties associated to rays in the generalized Delannoy matrix. J. Differ. Equ. 2019, 25, 1200–1215. [Google Scholar] [CrossRef]
  6. Kuhapatanakul, K. Some connections between a generalized Tribonacci triangle and a generalized Fibonacci sequence. Fibonacci Q. 2012, 50, 44–50. [Google Scholar]
  7. Mu, L.; Zheng, S. On the total positivity of Delannoy-like triangles. J. Integer Seq. 2006, 20, 17.1.6. [Google Scholar]
  8. Yang, S.; Zheng, S.; Yuan, S.; He, T. Schröder matrix as inverse of Delannoy matrix. Linear Algebra Appl. 2013, 439, 3605–3614. [Google Scholar] [CrossRef]
  9. Noble, R. Asymptotics of a family of binomial sums. J. Number Theory 2010, 130, 2561–2585. [Google Scholar] [CrossRef] [Green Version]
  10. Noble, R. Asymptotics of the weighted Delannoy numbers. Int. J. Number Theory 2012, 8, 175–188. [Google Scholar] [CrossRef]
  11. Wang, Y.; Zheng, S.; Chen, X. Analytic aspects of Delannoy numbers. Discrete Math. 2019, 342, 2270–2277. [Google Scholar] [CrossRef]
  12. Belovas, I. A central limit theorem for coefficients of the modified Borwein method for the calculation of the Riemann zeta-function. Lith. Math. J. 2019, 59, 17–23. [Google Scholar] [CrossRef]
  13. Belovas, I. A local limit theorem for coefficients of modified Borwein’s method. Glas. Mat. 2019, 54, 1–9. [Google Scholar] [CrossRef] [Green Version]
  14. Belovas, I.; Sabaliauskas, M. Series with binomial-like coefficients for the evaluation and 3D visualization of zeta functions. Informatica 2020, 31, 659–680. [Google Scholar] [CrossRef]
  15. Belovas, I.; Sakalauskas, L. Limit theorems for the coefficients of the modified Borwein method for the calculation of the Riemann zeta-function values. Colloq. Math. 2019, 151, 217–227. [Google Scholar] [CrossRef]
  16. Alladi, K.; Hoggatt, V.E., Jr. On Tribonacci numbers and related functions. Fibonacci Q. 1977, 15, 42–45. [Google Scholar]
  17. Hwang, H.-K. On convergence rates in the central limit theorems for combinatorial structures. Eur. J. Comb. 1998, 19, 329–343. [Google Scholar] [CrossRef] [Green Version]
  18. Bender, E.A. Central and local limit theorems applied to asymptotic enumeration. J. Comb. Theory Ser. A 1973, 15, 91–111. [Google Scholar] [CrossRef] [Green Version]
Table 1. The tribonacci triangle ( T n , k numbers, see Equation (1)).
Table 1. The tribonacci triangle ( T n , k numbers, see Equation (1)).
k012345
n
0100000
1110000
2131000
3155100
41713710
519252591
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Belovas, I. Central and Local Limit Theorems for Numbers of the Tribonacci Triangle. Mathematics 2021, 9, 880. https://doi.org/10.3390/math9080880

AMA Style

Belovas I. Central and Local Limit Theorems for Numbers of the Tribonacci Triangle. Mathematics. 2021; 9(8):880. https://doi.org/10.3390/math9080880

Chicago/Turabian Style

Belovas, Igoris. 2021. "Central and Local Limit Theorems for Numbers of the Tribonacci Triangle" Mathematics 9, no. 8: 880. https://doi.org/10.3390/math9080880

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop