A series of sequences convergent to Euler’s constant

In this paper, using continued fraction, we provide a new quicker sequence convergent to Euler’s constant. We demonstrate the superiority of our new convergent sequences over DeTemple’s sequence, Mortici’s sequences, Vernescu’s sequence, and Lu’s sequence.


Introduction
As it is known, defining some new approximations toward fundamental constants plays an important role in the field of mathematical constants. One of the most famous constants is Euler's constant γ = 0.577215 . . . , which is defined as the limit of the sequence and has numerous applications in many areas of pure and applied mathematics, such as analysis, number theory, theory of probability, applied statistics, and special functions. Up until now, many authors have devoted great efforts and achieved much in the area of improving the convergence rate of the sequence (γ n ) n≥1 . Among them, there are many inspiring achievements. For example, the estimate 1 2(n + 1) < γ nγ < 1 2n (Young) (1.2) was given in [1][2][3][4].
In [5,6], a new sequence (D n ) n≥1 converging faster to γ was introduced, which is defined as D n = 1 + 1 2 + 1 3 + · · · + 1 n -ln n + 1 2 . (1.3) DeTemple also concluded that the speed of the new sequence to γ is of order n -2 since 1 24(n + 1) 2 < D nγ < 1 24n 2 (DeTemple). (1.4) Another modification was provided by Vernescu [7] as (1.5) who proved that (1.6) It is easy to conclude that though (1.3) and (1.5) only make slight modifications on the Euler's sequence (1.1), but the convergent rates are significantly improved from n -1 to n -2 . Moreover, Mortici obtained some sequences converging even faster than (1.1), (1.3), and (1.5). More specifically, Mortici [8] constructed the following two sequences: Both (1.7) and (1.8) had been proved to converge to γ as n -3 . Moreover, Mortici [9] introduced the following class of sequences: where a, b ∈ R, a > 0. They proved that, among the sequences (μ n (a, b)) n≥1 , in the case of a = √ 2/2 and b = (2 + √ 2)/4 the privileged sequence offers the best approximations of γ since (1.13) These two sequences converge faster than all other sequences mentioned since for all n ∈ N, 7 288(n + 1) 3 < γγ (2) n,1 < 7 288n 3 and On the other hand, Lu [11] introduced the following class of sequences: where k, s ∈ N. They also proved that, among the sequences (K (s) n,k ) n≥1 , in the case of the privileged sequence offers the best approximations of γ since when s = 1, These works motivated our study. In this paper, our main goal is to modify the sequence based on the early works of DeTemple, Moritici, and Lu and provide a new convergent sequence of relatively simple form with higher speed.
The rest of this paper is arranged as follows. In Sect. 2, we provide the main results and, in Sect. 3, we prove them.

The main results
Lemma 2.1 For any fixed a, b ∈ R, we have the following convergent sequence for Euler's constant: for a = 6 -2 and for a = 6 + 2 Using Lemma 2.1, we have the following conclusion.

Corollary 2.2
The fastest possible sequence (N n,a,b ) n≥1 is obtained only for

Theorem 2.3
For any fixed s ∈ N, there exist k ∈ N and a, b ∈ R such that the following sequence converges to Euler's constant:

The proof of Theorem 2.3
Based on the argument of Theorem 2.1 in [13] or Theorem 5 in [14], we need to find the value of a 1 ∈ R that produces the most accurate approximation of the form N n,a,b = 1 + 1 2 + 1 3 + · · · + 1 n -1 + 1 an -ln(n + b).
To measure the accuracy of this approximation, a method is to say that an approximation (3.1) is better as N n,a,bγ faster converges to zero. Using (3.1), we have Developing in power series in 1/n, we have From Lemma 2.4 we know that the speed of convergence of the sequence (N n,a,b ) n≥1 is even higher than the value s satisfying (2.15). Thus, using Lemma 2.4, we have: If -1 a + b 2 + b + 1 3 = 0, then the rate of convergence of the sequence (N n,a,bγ ) n≥1 is n -2 since lim n→∞ n 2 (N n,a,bγ ) = -1 2a and the rate of convergence of the sequence (N n,a, Moreover, for a = 1 and b = 0, we have Proof of Theorem 2. 3 We define the sequence (γ (s) n,a,b,k ) n≥1 by the relations a s n s (3.9) and γ ≈ γ (1) n,k,a,b = 1 + Using a similar method as in (3.1)-(3.3), we have 12ak , and the rate of convergence is n -3 . For example, for a = 2 and b = 1/(2 and the rate of convergence is n -3 . Next, we define the second sequence with the previous conclusions: γ (2) n,k,a,b = 1 + where a 1 = 2k-2abk-ak 2a . Then we get the equation γ (2) n,k,a,bγ (2) n+1,k,a,b we obtain the fastest sequence (γ (2) n,a,b,k ) n≥1 with convergent rate n -4 since lim n→∞ n 4 γ (2) n,a,b,kγ = - Moreover, for we define the third sequence with the previous conclusions: (3.14) Then we have the equality