Preprint
Article

This version is not peer-reviewed.

On Some Series Involving Reciprocals of $\binom{2n}{n}$ and the Catalan's Constant $G$

Submitted:

05 November 2024

Posted:

06 November 2024

You are already at the latest version

Abstract
We investigate a class of combinatorial sums involving reciprocals of central binomial coefficients , employing generating functions as the primary solution technique to formulate and analyze series involving the Catalan's constant. Using a direct approach, we derive new identities through integral techniques.
Keywords: 
;  ;  ;  

1. Introduction

In the field of mathematics, Catalan’s constant, denoted as G, represents a fascinating quantity characterized by its unique properties. Specifically, it is defined as the alternating sum of the reciprocals of the odd square numbers. This can be mathematically expressed as follows:
G : = n = 0 ( 1 ) n ( 2 n + 1 ) 2 0 . 915965 . .
This intriguing constant arises in various mathematical contexts, particularly in number theory and combinatorial mathematics, where it serves as a fundamental element in the study of series and special functions. The behavior of Catalan’s constant reveals deep connections to other mathematical constants and functions, showcasing the rich interplay within the realm of mathematical analysis.
In ([4],Pg 2), we have that,
G = 0 1 arctan x x d x = 1 2 0 x cosh x d x = 2 0 π 4 log ( 2 cos x ) d x
which serves as some basic integral representation of G. Now, the binomial coefficient n m is defined by
n m = n ! m ! ( n m ) ! , if n m ; 0 , if n < m .
where n and m are non-negative integers. For some results involving the inverse of binomial coefficients, see [1,2,5]. Among the conclusions drawn in this paper, we will ascertain that if n is a non-negative integer then
n = 1 2 n n 2 n + 2 n + 1 1 16 n ( n + 1 ) ( 2 n + 3 ) = 22 3 8 π 16 G π
Throughout this paper, we verify our results using Computer Algebra System (CAS) software Mathematica 13.3.

2. Generating Functions

This section provides essential preliminary concepts that will serve as foundational building blocks for the analyses and results presented in the subsequent section. By establishing these key Lemmas, we aim to create a structured basis that will facilitate a clearer understanding of the subsequent results to follow. We proceed as follows:
Lemma 1. 
For x ( 0 , 4 ) , then
n = 1 x n n 2 n n = 2 x 4 x arctan x 4 x
Proof. 
Observe that,
n = 1 x n n 2 n n = 1 2 n = 1 x n 0 π 2 2 sin 2 n 1 θ cos 2 n 1 θ d θ = 0 π 2 1 sin θ cos θ n = 1 ( x sin 2 θ cos 2 θ ) n d θ = 0 π 2 x sin θ cos θ 1 x sin 2 θ cos 2 θ d θ = x 2 0 π 2 sin 2 θ 1 x 4 sin 2 θ d θ .
Set p = cos 2 θ and the result follows. □
Lemma 2. 
For all x ( 0 , 4 ] , then
n = 1 x n n 2 2 n n = 2 arctan 2 x 4 x
Proof. 
Notice that we can write as follows;
n = 1 x n n 2 2 n n = 1 2 n = 1 0 1 x n ( w w 2 ) n 1 n d w = 1 2 0 1 1 w ( 1 w ) n = 1 ( w x ( 1 w ) ) 2 n d w
Note that log ( 1 x ) = n = 1 x n n , thus we have
1 2 0 1 1 w ( 1 w ) n = 1 ( w x ( 1 w ) ) 2 n d w = 1 2 0 1 log ( x w 2 x w + 1 ) w ( 1 w ) d w J ( x )
Observe,
J ( x ) = 2 0 1 t i a l t i a l x log ( x w 2 x w + 1 ) w d w = 4 x x 4 x arctan x 4 x
Integrating both sides, we obtain the desired result. □
Lemma 3. 
For all x ( 0 , 4 ) , then
n = 1 x n + 3 / 2 n ( n + 3 / 2 ) 2 n n = 4 9 4 x x 4 x ( x + 24 ) 3 ( x + 8 ) arctan x 4 x
Proof. 
From Lemma 1, multiply both sides by x and then integrate with respect to x. Thus, the result follows. □
Numerous authors have proposed similar generating functions expressed in terms of the arcsine function, but the difference is very minimal, (See, [5]).
Lemma 4. 
For all x [ 1 , 1 ]
n = 1 2 n n x 2 n + 2 2 2 n + 1 ( n + 1 ) ( 2 n + 3 ) = 1 x 2 6 1 x 2 2 arcsin x 2 x
Proof. 
It can be shown that
n = 1 2 n n x 2 n 4 n = 1 1 x 2 1
Thus, multiply both sides of the above identity by x 2 and then integrate both sides to get,
n = 1 2 n n x 2 n + 3 ( 2 n + 3 ) 4 n = 1 6 ( 3 arcsin x 3 x 1 x 2 2 x 3 ) + C
Observe, as x 0 we have that C 0 . Hence C = 0 . By dividing through by x 2 and integrating both sides, we obtain;
n = 1 2 n n x 2 n + 2 2 2 n + 1 ( n + 1 ) ( 2 n + 3 ) = x 2 6 1 x 2 2 arcsin x 2 x + C 1
Similarly as x 0 , we have that C 1 1 . Hence, the result follows directly. □
Lemma 5. 
For all x [ 1 , 1 ]
n = 1 2 n n x 2 n + 2 16 n ( n + 1 ) 2 ( 2 n + 1 ) = log 2 2 + x arcsin x + 2 1 x 2 log x arctanh ( 1 x 2 ) x 2 4
Proof. 
Since, we can show that
n = 1 2 n n x 2 n + 1 4 n ( 2 n + 1 ) = arcsin x x
Integrating both sides of the above identity we get a new identity
n = 1 2 n n x 2 n + 2 4 n ( 2 n + 1 ) ( 2 n + 2 ) = x arcsin x + 1 x 2 x 2 2 1
Dividing both sides by x and integrating both sides. The desired result follows immediately. □
Lemma 6. 
For all x [ 1 , 1 ]
n = 1 2 n n x 2 n + 2 2 2 n + 1 ( n + 1 ) ( 2 n + 1 ) ( 2 n + 3 ) = 1 12 9 1 x 2 + ( 6 x 2 + 3 ) x arcsin x 2 x 2 12
Proof. 
Notice,
n = 1 2 n n x 2 n + 2 2 2 n + 1 ( n + 1 ) ( 2 n + 1 ) = x arcsin x + 1 x 2 x 2 2 1
The result follows from the above identity. □

3. Main Results

Theorem 1. 
If n is a non-negative integer, then we have
n = 1 2 n n 2 n + 2 n + 1 1 16 n ( n + 1 ) ( 2 n + 3 ) = 22 3 8 π 16 G π
Proof. 
From Lemma 4, set x = sin y and using the walli’s integral formula;
2 n n = 2 π 0 π 2 2 2 n sin 2 n t d t
Thus,
n = 1 2 n n 2 n + 2 n + 1 π 2 4 n + 4 ( n + 1 ) ( 2 n + 3 ) = 0 π 2 1 sin 2 x 6 cos x 2 x 2 sin x d x = 11 π 24 1 2 G
Since 0 π / 2 x 2 sin x d x = G , check [[4],Pg 2]. The result follows immediately. □
Theorem 2. 
If n is a non-negative integer, then
n = 1 2 n n 2 n + 2 n + 1 1 64 n ( n + 1 ) 2 ( 2 n + 1 ) = 8 log 2 17 2 + 24 π 16 G π
Proof. 
From Lemma 5, Set x = sin y , while integrating from 0 to π / 2 and using the identity;
π 2 2 n + 3 2 n + 2 n + 1 = 0 π / 2 sin 2 n + 2 t d t
Note that the above equality follows directly from the walli’s integral formula. The proof is straightforward from this end. □
Theorem 3. 
If n is a non-negative integer, then
n = 1 2 n n 2 n + 2 n + 1 1 16 n ( n + 1 ) ( 2 n + 1 ) ( 2 n + 3 ) = 20 π + 8 G π 26 3
Proof. 
From Lemma 6, following same pattern in Theorem 2 and using (7) with the famous identity from [[4],Pg 2];
0 π / 2 x 2 sin x d x = G
The desired result follows immediately. □

4. Some Interesting Series

From Lemma 1 to Lemma 3, we can generate some Lehmer Series [check, [5]]
n = 1 2 n n 2 n n 1 = π 2
n = 1 4 n n 2 2 n n 1 = π 2 2
n = 1 1 n 2 ( n + 2 ) 2 n n 1 = 1 72 ( 117 + 42 π 3 10 π 2 )
n = 1 1 n ( n + 3 / 2 ) 2 n n 1 = 100 9 2 3 π
n = 1 1 n ( n + 3 / 2 ) ( n + 5 / 2 ) 2 n n 1 = 4 225 ( 1384 + 255 π 3 )
We also have,
n = 1 n 2 16 n ( 2 n 1 ) 2 ( 2 n + 1 ) 2 n n 2 = G 4 π + 1 8 π
It’s easy to derive (14) from
n = 1 2 n 2 x 2 n 1 4 n ( 2 n 1 ) 2 ( 2 n + 1 ) 2 n n = 1 8 x 2 ( 2 x 2 + 1 ) arcsin x x 1 x 2
Now multiply by x and set sin t = x , then we integrate both sides from 0 to π / 2 . Then, (14) follows directly. From Lemma 3, we noticed that the Guass Hyper-geometric function of the form
F 1   2   [ 2 , 2 ; 9 / 2 ; 1 / 4 k ] can be obtained. Observe,
n = 1 1 n ( n + 3 / 2 ) 2 n n 1 = 1 105 F 1   2   2 , 2 ; 9 2 ; 1 4 + 210 3 105 π 1120 105 = 100 9 2 3 π
n = 1 1 2 n + 3 / 2 n ( n + 3 / 2 ) 2 n n 1 = 1 840 2 F 1   2   2 , 2 ; 9 2 ; 1 8 + 11760 7 840 2 arcsin 1 2 2 11200 840 2 = 14 9 7 7 51 arctan 1 7 n = 1 1 3 n + 3 / 2 n ( n + 3 / 2 ) 2 n n 1 = 1 2835 3 F 1   2   2 , 2 ; 9 2 ; 1 12 + 41580 11 2835 3 arcsin 1 2 3 40320 2835 3 = 4 27 3 73 75 11 arctan 1 11
From the above, we can see that;
F 1   2   2 , 2 ; 9 2 ; 1 4 = 1120 210 3 π + 105 100 9 2 π 3 1.2947
F 1   2   2 , 2 ; 9 2 ; 1 8 = 11200 11760 7 arcsin 1 2 2 + 560 7 3 7 7 51 arctan 1 7 1.12378
F 1   2   2 , 2 ; 9 2 ; 1 12 = 40320 41580 11 arcsin 1 2 3 + 420 73 75 11 arctan 1 11 1.0795
In light of the aforementioned conclusions, a distinct pattern is discernible. Consequently, if k is a natural number, the following conjecture is proposed to hold true.
F 1   2   2 , 2 ; 9 2 ; 1 4 k = a k + 4 k 1 b k arcsin 1 2 k + c k arctan 1 4 k 1
Where the general expression of a k , b k , and c k remains open.

References

  1. N. Batir. An integral representation of some series involving 2 k k 1 k n and some related series. Appl. Math. Comput., 147(3):645-667, 2004.
  2. N. Batir. On the series k = 1 3 k k 1 k n x k . Proc. Indian Acad. Sci. (Math. Sci.), 115(4):371-381, 2005.
  3. N. Bhandari. Binomial sums resulting to the ratios, G/π and 1/π, Arhimede Mathematical Journal. No 1, 2022.
  4. David M. Bradley. Representations of Catalan’s Constant, 2001.
  5. D.H. Lehmer. Interesting series involving the central binomial coefficients. American Math. Monthly, 7:449-457, 1985.
  6. I.S. Gradshteyn and I.M. Ryzhik, eds., Table of Series, Integrals, and Products, 7th Edition, Academic Press, Elsevier, 2007.
  7. P. Nicolae, Problem C: 1280, Gaz. Mat. 97 (1992), 230.
  8. A.S. Olofin and S.E. Olamide. Series Associated with Harmonic Numbers, Fibonacci Numbers and Central Binomial Coefficients 2 n n 2024. [CrossRef]
  9. S. Vajda. Fibonacci and Lucas Numbers, and the Golden Section: Theory and Applications, Dover Press, 2008.
  10. F. Zhen Zhao and Tianming Wang, Some results for sums for the inverse of binomial coefficients, Integers 5(1) (2005), Paper A22.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated