Derivation of Closed-Form Expressions in Apéry-like Series Using Fractional Calculus and Applications

: This paper explores the Apéry-like series and demonstrates the derivation of closed-form expressions using fractional calculus. We consider a variety of Apéry-like functions, which were categorized by their functional forms and coefficients by applying the Riemann–Liouville fractional integral and derivative to examine their properties across various domains. The study focuses on establishing rigorous mathematical frameworks that unveil new insights into the behaviors of these series, contributing to a deeper understanding of number theory and mathematical analysis. Key results include proofs of convergence and divergence within specified intervals and the derivation of closed-form solutions through fractional integration and differentiation. This paper also introduces a method aimed at conjecturing mathematical constants through continued fractions as an application of our results. Finally, we provide the proof of validation for three unproven conjectures of continued fractions obtained from the Ramanujan Machine


Introduction
In the fields of mathematics, Apéry-like series hold significant value in number theory and combinatorics, which is noted especially for the challenges they posed in deriving closed-form expressions.Historically, these series have been crucial and involved in various mathematical proofs, particularly in establishing the transcendence and irrationality of numbers.In addition, Apéry-like series have also been utilized with many applications such as stochastic process [1], continued fraction [2-4] and other applications; see [5][6][7].The application of fractional calculus, which extends ordinary differentiation and integration to non-integer orders, introduces a novel approach to these complex series.The knowledge of fractional calculus offers a sophisticated toolkit for managing differential and integral equations, often surpassing the capabilities of traditional techniques.Its ability to precisely adjust differentiation and integration parameters makes it exceptionally adept at exploring the intricate behaviors of the Apéry-like series.
This paper explores the intersection of Apéry-like series and fractional calculus by using the fractional calculus idea to derive closed-form expressions for these series.Using the flexibility of fractional operators, we examine their convergence properties in different mathematical domains.This research not only connects two significant areas of mathematical study but also expands the theoretical framework, introducing innovative methods and results that enrich our understanding of advanced mathematical concepts.
We start by revisiting the fundamental definitions and properties of the Apéry-like series, highlighting key equations that underpin our study.The following series is typically expressed by This formula and its variations have been extensively studied and documented in the mathematical literature [8][9][10][11].In 2000, Sherman [11] identified numerous Apéry-like series, which are beautiful and interesting.Unfortunately, closed-form expressions for his Apéry-like series are only available in certain cases.Moreover, even advanced mathematical software such as MATLAB and Mathematica, which define the state of the art in technical computing and provide essential computations, cannot offer these closed-form expressions.This poses a significant inconvenience for researchers who need explicit solutions.This paper aims to address this gap by analyzing the closed-form expressions of the Apéry-like series, focusing on three specific types of functions f n (x), which are described as follows: Type I:II f n (x) = (4x) n 2n + a for a positive odd number a, Type II:I f n (x) = (4x) n n + b for a non-negative integer b, Type III: where x is a real number, n is a non-negative integer, and Q(n) and P A,B (n) are polynomials in variable n with deg Q(n) < deg P A,B (n).Here, A is a finite subset of positive odd numbers (denoted by A ⊂ 2N − 1) and B is a finite subset of natural numbers (denoted by B ⊂ N).We note here that the Type III function results from the interaction between Types I and II.One application of (2)-( 4) is to provide rigorous proofs for conjectures generated by the Ramanujan Machine [12][13][14], which signifies a shift toward automated discovery processes using exhaustive search techniques.Despite notable successes, this approach is inherently limited by its computational expense and the finite scope of search parameters.Our results address and mitigate these limitations, as demonstrated in Section 4.
The rest of this paper is organized into five sections.In Section 2, the foundational concepts of fractional calculus, particularly the Riemann-Liouville definitions, are introduced for both the fractional integral and fractional derivative.In Section 3, we apply fractional calculus techniques to derive new closed-form expressions for these Apéry-like series (2)-( 4) and also consider the convergence and divergence domains.Section 4 demonstrates applications of our results by proving and validating three unproven conjectures of continued fractions from the Ramanujan Machine based on the MITM-RF algorithm [13] to illustrate the versatility of our work.Finally, the conclusion is discussed in Section 5. Additionally, several closed-form results of Apéry-like series are proposed in Appendices A and B.

Fractional Calculus
In this section, we explore the fundamental concepts and properties of fractional calculus, as referenced in [15][16][17][18][19], which are crucial to formulating the summations of Apéry-like series as discussed in Section 3. Our discussion begins with definitions of the Gamma function and a pivotal element in the development of fractional calculus, together with its properties; see [20] for more details.Definition 1.The Gamma function is defined by the following improper integral: Integration by parts confirms that the Gamma function satisfies the recursive relation Γ(z + 1) = zΓ(z).This recursion with Γ(1) = 1 allows us to deduce by induction that Γ(n + 1) = n! for all non-negative integers n.Moreover, an interesting property of the Gamma function when z = 1 2 is Γ( 1 2 ) = √ π.By utilizing the recursive relation Γ(z + 1) = zΓ(z) combined with the base case Γ( 12 ) = √ π, the evaluation of Γ(n + 1 2 ) for a non-negative integer n is demonstrated in Property 1.This property is essential for later discussions on half-integrals and half-derivatives, which rely on the Gamma characteristics.
Definition 2. The double factorial of integer n ≥ −1 is defined in the usual factorial n! by Property 1 ([20]).For any non-negative integer n, the Gamma function satisfies the following: In addition to the specific properties of the Gamma function, we consider the Riemann-Liouville operator, which is the most common tool for fractional integration and differentiation.The concept of the Riemann-Liouville fractional integral operator arises from generalizing Cauchy's formula for an n-fold integral [15]: Since (n − 1)! = Γ(n), Riemann extrapolated that the formula (6) could be adapted for non-integer orders n, denoted by α, motivating the definitions of fractional integration.Now, we consider the two definitions established by Krug [21] as presented below.
and the right-sided Riemann-Liouville fractional integral in [a, b] is defined by By employing the idea of the fundamental theorem of calculus for ordinary integration and differentiation, we can define the derivative of non-integer order from Definition 3, also known as the fractional derivative, as follows.
and the right-sided Riemann-Liouville fractional derivative in [a, b] is defined by where α > 0 and n = [α] + 1 when [α] is the integer part of order α.
Note that the operators I n c and D n c for c ∈ {a+, b−} agree with the ordinary integral and differential operations of order n ∈ N. The fractional integral and differential operators in the Riemann-Liouville sense, being linear operations, exhibit several significant properties [15][16][17], such as if u(x) is the power function, then its fractional integral and derivative are evaluated as follows.
Property 2 ([17]).Let β ≥ 0.Then, we have Example 1.Consider Property 2 in cases of β = n + 1 for n ∈ N ∪ {0} := N 0 and zero limit of integrations; then, we obtain x n+α for x > 0, x n−α for x > 0, Next, we consider the special case where α = 1 2 for both the fractional integral and derivative (also known as the half integral and half derivative) of the function u(x) = x n for all n ∈ N 0 , according to Definitions 3 and 4.These properties play an important role in establishing closed-form expressions of the Apéry-like series.

Corollary 1.
Let n be a non-negative integer.Then, we have the following relations.

1.
The left-sided half integral is

2.
The left-sided half derivative is

3.
The right-sided half integral is

4.
The right-sided half derivative is Proof of Corollary 1.Since (2n)!! = 2 n n!, we transform the formula of Gamma function Γ(n + 1 2 ) in Property 1 into another form as Let n ∈ N 0 .We can prove the Formulas ( 13)-( 16) by using the relation (17) together with the consequences as expressed in Example 1 as follows. 1.
Proof (13): Apply (17) and the left-sided half integral (11) with α = 1 2 : 2. Proof ( 14): Utilize Definition 4 to transform operators of fractional derivative into a fractional integral and employ the obtained result of left-sided half integral (13) to yield the following result:

4.
Proof (16): Similar to the proof of ( 14), utilize Definition 4 to transform the operators and use the obtained result of the right-sided half integral (15) to obtain the following: This completes the proof.

Summation of Apéry-like Series
In this section, our goal is to transform the summations of Apéry-like series into closedform expressions.We divide our analysis into three subsections; each is dedicated to a different type of function f n (x), as defined in (2)-( 4).Initially, we substitute these functions into the general form of the Apéry-like series (1).This leads to new series representations, denoted by F m (x), G m (x) and H A,B (x), which are defined as follows: where x is a real number, m is a natural number and n is a non-negative integer.Polynomials Q(n) and P A,B (n) are functions of n with deg Q(n) < deg P A,B (n).

Analysis of Type I: Apéry-like Series F m (x)
This section derives the closed form of the Apéry-like series F m (x) as defined in (18).Our analysis is structured into four main parts.First, Theorem 1 identifies the convergence and divergence domains for x.Then, Theorem 2 explores the behavior of the initial series F 1 (x).Building on this, Theorem 3 introduces a recurrence relation that outlines the series progression.Finally, Theorem 4 uses this relation to establish a closed-form expression, enhancing our understanding of the series.Additionally, we examine how variations in x and m affect the results, revealing diverse outcomes from applying the established formulas.
Theorem 1.For a natural number m and a nonzero real number x, the Apéry-like series Proof of Theorem 1.Let m ∈ N and x ∈ R. We define a n := (n!) 2 (4x) n (2n)!(2n+2m−1) .To determine the convergence of F m (x), we apply the ratio test as follows: Thus, the series converges when |x| < 1, which implies that the convergence domain is x ∈ (−1, 1).Furthermore, the ratio test indicates that the series diverges when |x| > 1, establishing the divergence domain as Next, we explore the behavior of the Apéry-like series where x = −1: where b n := (n!) 2 4 n (2n)!(2n+2m−1) > 0 for all m ∈ N and n ∈ N 0 .To verify convergence, we apply the alternating series test, which requires analyzing the limit of b n as n → ∞.To consider the boundary of b n , we have Since lim n→∞ 0 = 0 and lim n→∞ (2n)!! (2n+1)!! = 0 were obtained in [22], which is one of the Wallis integral properties, by squeezing theorem, lim n→∞ b n = 0.This result implies that the terms of the series decrease in magnitude and approach zero, satisfying the conditions for the alternating series test.Further, we examine the monotonicity of the sequence b n : This calculation shows that b n forms a decreasing sequence of non-negative real numbers, and thus b n → 0 as n → ∞.Hence, the alternating series test confirms that the Apéry-like series F m (x) converges at x = −1.
Finally, we examine the behavior of the Apéry-like series at x = 1 as follows 2n+2m diverges by the limit comparison test.Thus, by the comparison test, F m (1) diverges.Hence, x = 1 falls within the divergence domain for the Apéry-like series F m (x).The proof is complete.Now, our focus shifts to computing the specific convergence values for F m (x) on the interval [−1, 1), starting with the particular case where m = 1.In this context, Theorem 2 provides the explicit formula for F 1 (x), utilizing principles of fractional calculus as discussed in Section 2.
Theorem 2. The initial Apéry-like series F 1 (x) can be expressed by the following explicit formula: Proof of Theorem 2. Let x ∈ (0, 1).By using the left-sided half integral (13), we can transform the Apéry-like series F 1 (x) to be Based on Definition 3, we can see that the half-integral operator I 0+ is a linear operation and x−τ is convergent for n ∈ N 0 and x > 0.Then, we can apply the infinite geometric series ∑ ∞ n=0 τ n = 1 1−τ for |τ| < 1 to consider the above equation as follows Next, to evaluate the above integral, we can use a substitution to simplify the integrand.Let τ = x(1 − u).Then, dτ = −x du and 0 ≤ u ≤ 1.Now, substituting τ = x(1 − u) into the integrand and u = 1 with u = 0 into the limits of integration, we obtain We use the substitution v = √ u, where u = v 2 and du = 2v dv, This integral can now be identified as a standard form of the integral that results in the inverse trigonometric of tangent function: x and b = x, the above integral can be evaluated as For x ∈ (0, 1), we thus obtain Next, let x ∈ [−1, 0); then, the Apéry-like series F 1 (x) can be proved in a similar way to x ∈ (0, 1) by using the right-sided half integral (15) to reformulate being Subsequently, we consider the summation of the right-sided half integral according to Definition 3. In addition, This integral can be evaluated similarly to the case of x ∈ (0, 1).Thus, it becomes Hence, for x ∈ [−1, 0), we have .
Finally, for x = 0, it is clear that F 1 (0) remains only the first term of summation, resulting in F 1 (0) = 1.Therefore, the proof is complete.
It should be noted that using classical integration with respect to x and substituting x with x 2 in (21) yields the same result, namely, y(x , as stated in Proposition 15 of [23], p. 262.This result is derived by using classical calculus to find the explicit solution of the ordinary differential equation (1 − x 2 )(y ′ ) 2 = 4y.In other words, applying classical differential calculus to the result in [23], p. 262 yields (21).
Prior to establishing the closed-form formula for the Apéry-like series F m (x), we can derive the linear recurrence relation from F m (x), as delineated in (18).The formulation of this relation involves a strategy of re-indexing the series coupled with applying the partial fraction decomposition.The relation is explicated in Theorem 3.
Theorem 3. The Apéry-like series F m (x) defined in (18) can be expressed in the following linear recurrence relation where m ∈ N and x ∈ [−1, 1), starting with F 1 (x), as defined in (21).
Proof of Theorem 3. Consider To manipulate the preceding equation, we arrive at the expression of F m+1 (x) that follows as (22).The application of mathematical induction on m allows us to substantiate the linear recurrence relation delineated in (22).
The results elucidated from Theorem 3 are herein presented.Example 3 delineates the initial five instances of the Apéry-like series F m (x) for m ∈ {1, 2, 3, 4, 5}.
The results asserted in Example 3 are recursively derived from the linear recurrence relation in Theorem 3 with the initial function F 1 (x) provided in Theorem 2. Consequently, we elucidate the closed-form expression for the Apéry-like series F m (x) by employing the linear recurrence relation delineated in (22), as thoroughly expounded in Theorem 4. Theorem 4. For m ∈ N, x ∈ [−1, 1) and F 1 (x) as defined in (21), we have Proof of Theorem 4. First, we rewrite the linear recurrence relation ( 22) expressed as where a m (x) := 2m (2m−1)x and b m (x Given that m ∈ N and x ̸ = 0, it follows that a m (x) ̸ = 0. Subsequently, we divide the linear recurrence relation (23) by the product ∏ m r=1 a r (x) to obtain ∏ m r=1 a r (x) or it can be simplified as For convenience, let us define for m > 1 and 24), we obtain the following relation: Next, we consider the summation of any consecutive differences Q n (x) and Q n+1 (x) for all n ∈ {1, 2, 3, . . ., m} by using (25), which facilitates the derivation of an explicit formula F m+1 (x) in terms of the initial function F 1 (x) and the coefficients a n (x) and b n (x), ∏ m r=1 a r (x) and Q 1 (x) = F 1 (x), we substitute them back into (26).Then, it can be expressed as the explicit solution: To simplify ∏ m r=1 a r (x) into an explicit form, we proceed as follows: Finally, we substitute ( 28) into (27) and manipulate it to obtain the closed-form formula of the Apéry-like series F m+1 (x) as follows: Hence, the proof is complete.

Analysis of Type II: Apéry-like Series G m (x)
This section delineates the closed-form derivation of the Apéry-like series G m (x), as initially defined in (19).Our exploration consists of four critical stages.First, Theorem 5 identifies the convergence domain for G m (x).Subsequently, Theorem 6 delves into the initial series G 1 (x).Theorem 7 introduces a linear recurrence relation characterizing G m (x), leading to Theorem 8, which establishes the closed form of the series.Additionally, the interaction between variables x and m is examined to uncover significant insights.
Theorem 5.For a natural number m and a nonzero real number x, the Apéry-like series Proof of Theorem 5.By similar argument as in the proof of Theorem 1 and the fact that where a n := (2n)!(n+m) , we can conclude that G m (x) converges on x ∈ (−1, 1) and diverges on x ∈ (−∞, −1) ∪ (1, ∞).Next, we examine the convergence at x = −1 for the Apéry-like series G m (−1) using the comparison test.The series is defined as where b n := (2n)!(n+m) > 0 for all m ∈ N and n ∈ N 0 .To verify convergence, we apply the alternating series test, which requires analyzing the limit of b n as n → ∞.We have [22], which is one of the Wallis integral properties.Further, we examine the monotonicity of the sequence b n : Thus, b n+1 ≤ b n for all n ≥ m − 1; in other words, b n is then an eventually decreasing sequence and also lim n→∞ b n = 0. Hence, the alternating series test confirms that the Apéry-like series G m (x) converges at x = −1.
Finally, we analyze the behavior of the Apéry-like series at the domain point x = 1, specifically to test the divergence of the series G m (1).Consider the series expressed as shown below: Since lim n+2m diverges by the limit comparison test.Thus, by the comparison test, G m (1) diverges.Hence, we conclude that the point x = 1 lies within the divergence domain of the Apéry-like series, thus completing our proof.
In the preceding analysis, we confirmed that the Apéry-like series G m (x) converges within the domain x ∈ [−1, 0) ∪ (0, 1), as demonstrated by Theorem 5. Building on this foundation, our next objective is to determine the convergence values for G m (x), beginning with the case where m = 1.To this end, we derive the explicit expression for G 1 (x) as outlined in Theorem 6, utilizing the principles of fractional calculus discussed in Section 2. Theorem 6.The initial Apéry-like series G 1 (x) is expressed in the explicit formula: Proof of Theorem 6.Let x ∈ (0, 1).By utilizing (14), we can transform G 1 (x) to become From Definition 4, we can interchange the summation into half-derivative operator D 1 2
Using the integral substitution, let τ = xu; then, dτ = x du.The limits of integration change accordingly, when τ = 0, u = 0 and when τ = x, u = 1.Thus, the above integral becomes According to the standard integral tables of Gradshteyn and Ryzhik [25], the result of this specific integral can be expressed in terms of the arcsin function, x .
After that, we derivative the above expression with respect to the variable x.Thus, for x ∈ (0, 1), G 1 (x) can be evaluated in a simplified form as Similarly, for x ∈ [−1, 0), we consider G 1 (x) by using the relation of the right-sided half derivative ( 16) to obtain Then, we reformulate the above summation similarly to the process to receive (30) based on Definition 4 and the infinite Mercator series [24], that is Evaluating the above integral according to the standard integral tables in [25], we obtain Finally, for x = 0, it is clear that G 1 (0) consists only of the first term in the summation, giving G 1 (0) = 1.Thus, the proof is complete.
Remark 2. We found that the Apéry-like series G 1 (x) can be written in terms of F 1 (x) as follows: , where F 1 (x) and G 1 (x) are defined in ( 21) and ( 29), respectively.
Before deducing the explicit formula for the Apéry-like series G m (x), we establish a linear recurrence relation as defined in (19).This process involves a deliberate re-indexing of the series and applying partial fraction decomposition, which is thoroughly explained in Theorem 7.
Proof of Theorem 7. We derive the linear recurrence relation (31) starting from the definition of G m (x) in (19) with the following steps: In addition, the mathematical induction technique applied to m enables us to validate the linear recurrence relation (31).Thus, the proof is complete.
The findings derived from Theorem 7 are hereby explained.Example 4 specifies the first five cases of the Apéry-like series G m (x) for m that belong to the set {1, 2, 3, 4, 5}.
The results asserted in Example 4 are recursively derived from the linear recurrence relation in Theorem 7 with the initial functions F 1 (x) and G 1 (x) provided in Theorems 2 and 6, respectively.Accordingly, the explicit formula for the Apéry-like series denoted by G m (x) is articulated by utilizing (31), as comprehensively described in Theorem 8, maintaining the notation introduced in Theorem 7. Theorem 8. Keeping the notation in Theorem 7, we have the following closed-form formula , where m ∈ N; and x ∈ [−1, 1), F 1 (x) and G 1 (x) defined in ( 21) and ( 29), respectively.
Proof of Theorem 8. From the linear recurrence relation (31), we denote its coefficients by c m (x) and d m (x).Thus, the recurrence relation (31) can be written as where c m (x) = 2m+1 2mx and d m (x) = F 1 (x) m + 2m+1 2m 2 x .Given that m ∈ N and x ̸ = 0, it follows that c m (x) ̸ = 0. Next, we divide the recurrence relation ( 23) by the product ∏ m r=1 c r (x) and simplify it to become Then, we can solve the linear recurrence relation (33) using the same process as in the proof of Theorem 4. Hence, the explicit solution G m+1 (x) of ( 33) can be expressed as follows To simplify ∏ m r=1 c r (x) into an explicit form, we proceed as follows: Finally, we substitute (35) into (34) and manipulate it to obtain the closed-form formula of the Apéry-like series G m+1 (x) as follows: Hence, the proof is complete.
Remark 3. We also propose eight instances in Appendix B for the Type II familiar of Apéry-like series G m (x) for m within the set {1, 2, 3, 4, 5} where each instance, originating from Theorem 8, is defined for x in the set {± 1 8 , ± 1 4 , ± 1 2 , ± 3 4 }.In the next section, these instances will serve a crucial role in the subsequent analysis of the Type III Apéry-like series H A,B (x).

Analysis of Type III: Apéry-like Series H A,B (x)
This section delves into the combination of Type I and Type II Apéry-like series, referred to as Type III, which is represented by the series formula in (20).By synthesizing the methodologies applied in the series F m (x) and G m (x), defined in (18) and (19), respectively, we unify these expressions under a new framework.Let k ∈ N. We define Further extending this approach, we generalize the expression for Apéry-like series as in (20), which allows for a more inclusive representation: where x is a nonzero real number, n is a non-negative integer, and Q(n) and P A,B (n Here, A denotes a finite set of positive odd numbers (A ⊂ 2N − 1), and B includes a finite set of natural numbers (B ⊂ N).
Let P A,B (n) be a polynomial in term of n.Then, we factorize it into two products of linear functions 2n + a i and n + b j , where a i ∈ A := {a 1 , a 2 , a 3 , . . ., a r 1 }, with A being a subset of odd numbers and b j ∈ B := {b 1 , b 2 , b 3 , . . ., b r 2 }, with B being a subset of natural numbers.The degree of the polynomial P A,B (n), denoted by deg P A,B (n) = r 1 + r 2 =: r, encompasses the combined count of elements in sets A and B. The polynomial P A,B (n) can thus be expressed as where Note that elements in the set Λ represent the distinct roots of the polynomial P A,B (n).
For convenience, we let the polynomial R(n

This formulation allows us to analyze the rational function
typically chosen to ensure non-repeated linear factors, facilitating the decomposition into partial fractions using the Lagrange interpolation method [26].Theorem 9 ([26]).Let Q(x) be a polynomial of degree less than n that interpolates the distinct points (x 1 , y 1 ), (x 2 , y 2 ), . . ., (x n , y n ) such that Q(x k ) = y k for each k.Suppose R(x) is an nth order polynomial with zeros at x 1 , x 2 , . . ., x n .The expressions for R(x) and its derivative at these points are given by The Lagrange interpolating polynomial for Q(x) is then defined as Considering the rational function in (37), assume unique constants c k ∈ R exist such that the rational function (n) can be expressed as a sum of partial fractions: where Evaluating the first-order derivative of R(n) at x = λ k using the product rule, we find From the definition of the Lagrange interpolating polynomial in Theorem 9, the coefficients of the partial fraction decomposition are derived: To compare the summations of ( 40) and (41), we thus yield the coefficients c k of decomposition into the partial fraction as follows: where λ k represents the zeros of P A,B (n), r = n(A ∪ B) is the degree of P A,B (n) and r 1 = n(A) is the count of terms involving the power of two in P A,B (n).
Remark 4. It should be noted that this section is closely aligned with the results presented in [27].However, it primarily offers a conceptual methodology for further exploration rather than delivering comprehensive proof.
Ultimately, the generalized Apéry-like series H A,B (x) can be straightforwardly derived to the explicit formula by directly using the relations of F m (x) and G m (x).To showcase the usage of this section, we present the following example.

Example 5. Consider the decomposition into partial fractions of the Apéry-like series
.
Let the polynomials Q(n) = 3n 2 + 5n − 5 and P A,B (n) = (2n + 1)(2n + 5)(n + 2)(n + 3), in which sets A = {1, 5} and B = {2, 3}.Then, we decompose the proper rational function Q(n) into the partial fractions as in (40), that is, where c k for k ∈ {1, 2, 3, 4} are unknown constants.Let Λ := {− 1 2 , − 5 2 , −2, −3} be the set of zeros of the polynomial P A,B (n).Using (42), we can find the unknown constants c k when given that λ k ∈ Λ as the following: , Hence, after substituting the proper rational function Q(n) P A,B (n) into the Apéry-like series H A,B (x), it can be expressed as the following partial fraction: However, the applications of this particular case in continued fractions will be discussed in detail in the next section.

Applications
This section applies the Apéry-like series in Section 3 to derive continued fractions.We also validate the Ramanujan Machine's unproven conjectures (identities) of continued fractions based on our proposed close-form formulas associated with the Apéry-like series.Typically, a generalized continued fraction is representable in various forms.Definition 5. Let (a m ) m≥1 and (b m ) m≥0 be sequences of complex numbers.The continued fraction, denoted by x, can be expressed as For any natural number m, the finite continued fraction of order m ≥ 1 is defined by Furthermore, if the limit of (44) exists, the continued fraction (43 Therefore, calculating A m and B m is essential to demonstrate the validity of the representation of the given continuation fraction.The following renowned result of the continued fraction theory establishes a connection between the convergence and the difference equations, as referenced in [28].
Laohakosol et al. [3] recently presented a specific closed-form solution for generalized second-order linear recurrence with coefficients represented by sequences of complex numbers, which is based on the idea of the counting set in [29,30].The result can be applied with simple continued fractions to confirm the considerable conjectures discovered by the Ramanujan Machine.

Theorem 10 ([3]
). Assume that there exist sequences (c m ) m≥1 and (d m ) m≥1 of complex numbers, such that d m ̸ = 0 and d 1 = b 0 , satisfying for all m ≥ 1.Then, the multiplicative inverse of the sequence A m B m , namely B m A m , can be expressed by Furthermore, the generalized continued fraction can be computed by The following Example 6 demonstrates applications of Theorem 10 to verify the unproven conjectures (identities) of the Ramanujan Machine discovered by Raayoni et al. [13] in 2021 and later proven by Sutthimat et al. [3] in 2024.Next, three unproven Ramanujan Machine conjectures listed in [13] are validated in the proofs of Conjectures 1-3, illustrating the versatility of our work.These conjectures are generated by the Ramanujan Machine using the MITM-RF algorithm provided in [14].
Example 6 ([13]).Verify the following Ramanujan Machine conjecture: .By applying (46) from Theorem 10 and utilizing the partial fraction as the same process of (42), we obtain It is evident that it converges when m approaches infinity.By using the relation (47) and the familiar identities of Propositions A6 and A15, we can therefore conclude that Next, we proceed to apply the obtained results of the Apéry-like series in Section 3 with Theorem 10 to validate and prove the following unproven Conjectures 1-3 of continued fractions.The Ramanujan Machine obtains these conjectures with the MITM-RF technique provided by [14] and listed in [13].
Conjecture 1 (unproven, listed in [13]).The unproven conjecture (identity) of continued fractions generated by the Ramanujan Machine: MITM-RF algorithm is 16 Proof of Conjecture 1.We take a m = −2m 4 + 3m 3 , m ≥ 1 and b m = 3m(m + 1) + 1, m ≥ 0 so that the sequences satisfying (45 for m ≥ 1.We denote the mth-order continued fraction (48) by Next, by using (46) from Theorem 10, we have Through the telescoping series, considering the above expression B m A m as m → ∞, we have By using the familiar identities from Propositions A6 and A15, the last series converges to Finally, the continued fraction (48) converges to lim m→∞ A m B m = 16 π 2 +4 , providing evident verification that Conjecture 1 is valid.Therefore, the proof is complete.
Conjecture 2 (unproven, listed in [13]).Next, we address the unproven conjecture (identity) of continued fractions generated by the Ramanujan Machine.The MITM-RF algorithm is 16 Next, we employ (46) from Theorem 10 to consider the inverse continued fraction: Through the telescoping series, considering the above expression B m A m as m → ∞, we have  Next, we employ (46) from Theorem 10 to consider the inverse continued fraction: .
Let ⟨x⟩ n = x(x + 1)(x + 2) . . .(x + n − 1) be the Pochhammer symbol used for simplifying the above expression.Through the telescoping series, the limit B m = 32 π 2 , providing evident verification that Conjecture 3 is valid.Therefore, the proof is complete.

Conclusions
This paper has explored the intersection of Apéry-like series and fractional calculus, leveraging the flexibility of fractional operators to derive closed-form expressions for these series rigorously.Our research addresses the gap in the availability of closed-form expressions for Apéry-like series by focusing on three specific types of functions and providing the conditions for their convergence.Despite the inherent limitations of computational approaches, our results mitigate these challenges and demonstrate their practical applicability.Additionally, we apply our findings to verify three unproven conjectures discovered by the Ramanujan Machine, illustrating the versatility and impact of our work.For future work, we plan to extend our study to more general classes of Apéry-like series involved with the following functions: f n (x) = (4x) n (2n+a) 2 , f n (x) = (4x) n (n+b) 2 and f n (x) = (4x) n an 2 +bn+c .This will enable us to further explore the potential of our methods and to prove other conjectures such as 16 + 3π 2 16 − π 2 = 7 + 3n 2 +23n+10 to complete the proof.As a final remark, one can observe that a conjecture can be generated from a linear combination of the Apéry-like series.This raises a common question: which linear combination of the Apéry-like series satisfies the system (45) and ensures the convergence of (47)?For example, the following series is not provided by the Ramanujan Machine

Definition 3 .
Let α > 0. The left-sided Riemann-Liouville fractional integral in [a, b] is defined by

Definition 4 .
The left-sided Riemann-Liouville fractional derivative in [a, b] is defined by