Next Article in Journal
First-Order Multipliers, Noether Symmetries and Variational Reduction of the Hunter–Saxton Equation
Previous Article in Journal
DAVis-Net: A Dual-Attention Deep Supervision Framework for Reliable Retinal OCT Image Classification with Integrated Explainability and Uncertainty Quantification
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Evaluation of a Subclass Kp,r = ∫xp(1 + x2)rdx of the Binomial Integral

by
Iickho Song
1,*,
So Ryoung Park
2 and
Lismer Andres Caceres-Najarro
3
1
Institute of Fundamental and Frontier Sciences, University of Electronic Science and Technology of China, Chengdu 611731, China
2
Department of Information, Communications, and Electronics Engineering, The Catholic University of Korea, Bucheon 14662, Republic of Korea
3
Department of Computer Science and Engineering, College of IT Convergence, Chosun University, Gwangju 61452, Republic of Korea
*
Author to whom correspondence should be addressed.
Math. Comput. Appl. 2026, 31(5), 191; https://doi.org/10.3390/mca31050191 (registering DOI)
Submission received: 4 August 2026 / Revised: 7 September 2026 / Accepted: 12 September 2026 / Published: 16 September 2026

Abstract

Employing the fundamental techniques of substitution, or change of variables, and integration by parts, the discussion in this paper focuses on obtaining explicit formulas for the integral K p , r = x p 1 + x 2 r d x for p Z and r 1 2 Z . As the case where r is a non-negative integer is rather simple and obvious, we concentrate mainly on the cases where r is a negative integer or an odd multiple of 1 2 except when consideration of other cases is appropriate.

1. Preliminary

The traditional analytical approach for evaluating integrals relies on a toolkit of substitution and reduction formulas through integration by parts. The results of such derivations, accumulated and compiled over centuries, resulted in a large number of formulas and are now available in encyclopedic handbooks [1,2], which serve as the authoritative reference for practitioners seeking a specific solution.
In the meantime, the modern algorithmic approach is embodied by symbolic computation packages such as Maple [3] and Mathematica [4], which implement sophisticated procedures, for instance the Risch-Norman algorithm, to find antiderivatives automatically [5]. These packages are highly effective in practice and routinely succeed in integrals for which manual derivation would be prohibitively laborious. Their integration engines typically combine several distinct algorithms and extensive rule tables: however, the internal criteria governing which procedure is invoked for a given integral are generally not exposed to the user [6]. In essence, while immensely powerful, these packages offer limited insight into the analytical relationships between solutions, mathematical structure of the solutions, or a methodology for manual derivation.
The evaluation of definite integrals involving generalized hypergeometric functions [7,8] continues to be an active line of inquiry, as illustrated by a recent study that evaluates a broad class of such integrals by means of generalized Watson-type summation formulas [9]. In modern mathematical physics, related integrals with integer and half-integer parameters are frequently analyzed using harmonic polylogarithms [10] and special-function expansions, particularly in the study of Bessel-type functions [11] and Feynman integrals [12,13]. Another work combines integration-by-parts with differential equations to reduce parametrized families of Feynman integrals to a basis of master integrals, using a projective-geometry formulation in Feynman-parameter space [14]. A related generating-function approach has been used to solve integration-by-parts relations for a family of one-loop integrals indexed jointly by tensor structure and propagator-power distribution [15].
The evaluation of binomial integrals of the form x p a + b x n r d x is a classical problem in integral calculus with importance in physics and engineering [16,17]. The theoretical limits of this problem were established by Chebyshev, whose theorem delineates the specific conditions under which these integrals can be expressed in terms of elementary functions [18]. The subclass K p , r = x p 1 + x 2 r d x of the binomial integrals constitutes a classical yet nontrivial problem in integral calculus, particularly when the parameters p and r extend beyond simple non-negative integers. Such cases arise naturally in various applications: for instance, the integral K 2 , 1 2 appears in the computation of surface areas of solids of revolution [19]. Some of the formulas in Sects. 2.110 and 2.27 of [2] can be interpreted as special cases of K p , r .
Despite the breadth of existing results [1,20], several limitations remain apparent in both pedagogical and research-oriented treatments of the integral K p , r . For instance, standard substitution techniques frequently lead to case-by-case calculations, which tend to obscure the underlying analytical structure of the solutions [19]. In addition, reduction formulas obtained through integration by parts often encounter ‘walls’ that interrupt recursive evaluation, requiring problem-dependent initial conditions. Furthermore, although closed-form expressions are available for many individual cases, these results are typically scattered across tables or derived in isolation [1,2] A unification effort has recently been undertaken for another classical family of parametrized integrals, Lobachevsky’s integrals, by combining parameter differentiation, partial fraction decomposition, and series expansion into a single systematic derivation covering all convergent cases [21], underscoring the continuing value of organizing scattered classical results within one coherent analytical framework.
In this paper, we develop a unified analytical and recursive framework for the systematic evaluation of K p , r . The approach in this paper is based on a detailed analysis of the parameter plane ( p , r ) . We identify five lines p = 1 , p = 1 , r = 0 , r = 1 , and p + 2 r + 3 = 0 along which the integral admits direct closed-form evaluation. These cases provide a natural set of initial conditions that anchor the recursive structure of the problem. Building upon these initial conditions, we derive four general recursion formulas that enable the evaluation of K p , r at any admissible point in the parameter plane while systematically bypassing the recursion barriers encountered, mostly on the line p + 2 r + 1 = 0 , in conventional approaches.
The main contributions of this work can be summarized as follows:
  • The parameter plane of ( p , r ) is systematically grouped to provide a unified analytical framework for the categorization and derivation of K p , r . Five fundamental lines are identified upon which the integral K p , r can be evaluated directly to serve as the foundational initial conditions.
  • Four recursion formulas are derived that enable the methodical generation of solutions at any admissible point ( p , r ) .
  • Recursive stability is ensured by systematically bypassing traditional recursion walls with a complete and sufficient set of initial conditions.
  • This work culminates in a compendium of explicit, closed-form formulas, serving as a valuable reference.

2. Evaluation of K p , r with Basic Techniques

In this paper, our focus will be on obtaining explicit formulas for the primitive function or antiderivative K p , r of x p 1 + x 2 r in the real domain, intervals of x avoiding x = 0 . Specifically, explicit formulas for
K p , r = x p 1 + x 2 r d x
on every point ( p , r ) in the set
Ω K = ( p , r ) : p Z , r 1 2 Z
of admissible points will be derived with the main focus on the cases where r is a negative integer or an odd multiple of 1 2 . Apparently, among the binomial integrals [16,17]
x p a + b x n r d x ,
where a , b R and p , n , r Q , the integral K p , r considered in this paper is a subclass with a = b , n = 2 , and ( p , r ) Ω K . It should be noted that (2) implies the existence of K p , r in terms of elementary functions by the theorem of Chebyshev [18] because r, p + 1 2 , and/or p + 1 2 + r will be an integer for every point ( p , r ) in the set Ω K .
Throughout the paper, except when necessary, integration constants will be omitted for brevity. From time to time, the terms antiderivative, primitive function, explicit formula, and integral will be used interchangeably with K p , r and explicit formula for the integral, which would not incur too much confusion.

2.1. Evaluation via Substitution

With x = tan θ and 1 + x 2 = t , we have
K p , r = sin p θ cos p + 2 r + 2 θ d θ
and
K p , r = 1 2 ( t 1 ) p 1 2 t r d t ,
respectively. In addition, with 1 + x 2 = t , we obtain
K p , r = t 2 1 p 1 2 t 2 r + 1 d t ,
similar to (5) but more useful, especially when r is an integral multiple of 1 2 .
Example 1. 
When p = 0 , using (4), we can obtain K 0 , 1 2 = ln x + 1 + x 2 , K 0 , 1 = tan 1 x , and K 0 , 3 2 = x 1 + x 2 . In addition, (4) can also be used to obtain
K 1 , 1 = 1 2 ln 1 + x 2
and
K 1 , 1 = 1 2 ln x 2 1 + x 2 .
Similarly, the result (5) can be used to obtain K 3 , 2 = 1 2 ln 1 + x 2 + 1 1 + x 2 , for instance. In addition, we can obtain K 1 , 1 2 = 1 + x 2 and K 1 , 1 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 with (6) after some steps.

2.2. Evaluation via Integration by Parts

When ( p , r ) = ( 1 , 0 ) , it is easy to see that K 1 , 0 = d x x or
K 1 , 0 = ln | x | .
Next, when p 1 , with u = x p , v = 1 + x 2 r , u = x p + 1 p + 1 , and v = 2 r x 1 + x 2 r 1 , we obtain
K p , r = x p + 1 1 + x 2 r p + 1 2 r p + 1 x p + 2 1 + x 2 r 1 d x .
Rewriting (10), we have
K p , r = x p + 1 p + 1 1 + x 2 r 2 r p + 1 K p , r + 2 r p + 1 K p , r 1 .
First, when 2 r p + 1 = 1 in (11), we obtain 0 = x p + 1 1 + x 2 r p + 1 + 2 r p + 1 K p , r 1 or
K p , p + 3 2 = x p + 1 p + 1 1 + x 2 p + 1 2
for p 1 . On the other hand, when 2 r p + 1 1 , we obtain 1 + 2 r p + 1 K p , r = x p + 1 1 + x 2 r p + 1 + 2 r p + 1 K p , r 1 , which can be expressed as
K p , r = x p + 1 1 + x 2 r p + 2 r + 1 + 2 r p + 2 r + 1 K p , r 1
for p + 2 r + 1 0 and p 1 . Although we assumed p 1 from the starting point of (10), the result (13) holds for p = 1 also, producing
K 1 , r = 1 2 r 1 + x 2 r + K 1 , r 1
for r 0 .
Similarly, when r 1 , with u = x p 1 , v = x 1 + x 2 r , u = ( p 1 ) x p 2 , and v = 1 + x 2 r + 1 2 ( r + 1 ) , we obtain
K p , r = x p 1 2 ( r + 1 ) 1 + x 2 r + 1 p 1 2 ( r + 1 ) x p 2 1 + x 2 r + 1 d x .
If p = 1 , we easily obtain
K 1 , r = 1 + x 2 r + 1 2 ( r + 1 )
for r 1 from (15): for r = 1 , recollect K 1 , 1 = 1 2 ln 1 + x 2 shown in (7).
Subsequently, (15) can be expressed as
K p , r = x p 1 2 ( r + 1 ) 1 + x 2 r + 1 p 1 2 ( r + 1 ) K p , r p 1 2 ( r + 1 ) K p 2 , r .
First, when p 1 2 ( r + 1 ) = 1 and r 1 , we obtain 0 = x p 1 2 ( r + 1 ) 1 + x 2 r + 1 p 1 2 ( r + 1 ) K p 2 , r or equivalently K p 2 , p + 1 2 = x p 1 p 1 1 + x 2 p 1 2 for p 1 : this result is the same as (12) when p is replaced with p + 2 . Next, when p 1 2 ( r + 1 ) 1 and r 1 , we obtain 1 + p 1 2 ( r + 1 ) K p , r = x p 1 2 ( r + 1 ) 1 + x 2 r + 1 p 1 2 ( r + 1 ) K p 2 , r , or
K p , r = x p 1 1 + x 2 r + 1 p + 2 r + 1 p 1 p + 2 r + 1 K p 2 , r
for p + 2 r + 1 0 and r 1 . When p = 1 , (18) is the same as (16). In (15), we have assumed r 1 : yet, (18) holds true for r = 1 also, producing
K p , 1 = x p 1 p 1 K p 2 , 1 .
Example 2. 
When p = 0 and r = 1 2 , we obtain K 0 , 1 2 = x 1 + x 2 + K 2 , 3 2 from (10). Thus, K 2 , 3 2 = K 0 , 1 2 x 1 + x 2 or
K 2 , 3 2 = ln x + 1 + x 2 x 1 + x 2
using the results K 0 , 1 2 = ln x + 1 + x 2 shown in Example 1. In addition, from (13), we have K 2 , 1 2 = x 3 2 1 + x 2 1 2 K 2 , 3 2 = x 3 + x 2 1 + x 2 1 2 ln x + 1 + x 2 and subsequently K 2 , 1 2 = x 3 4 1 + x 2 + 1 4 K 2 , 1 2 = 2 x 5 + 3 x 3 + x 8 1 + x 2 1 8 ln x + 1 + x 2 . We also have K 0 , 3 2 = 1 2 x 1 + x 2 1 2 K 2 , 3 2 from (18), and thus K 2 , 3 2 = 1 x 1 + x 2 2 K 0 , 3 2 = 2 x 2 + 1 x 1 + x 2 with K 0 , 3 2 = x 1 + x 2 shown in Example 1.

3. Derivation of Explicit Formulas

In the following developments, a = b c and a = b c denote the product and sum, respectively, for a = b , b + 1 , b + 2 , , c even when b and c are not integers. To denote ‘ k = p , p + 2 , ’, we use ‘ k = p : 2 ’ especially for the lower limit of a summation. We also let a = b c g ( a ) = 0 and a = b c h ( a ) = 1 if c < b . In addition, ( p , r ) often implies K p , r also. Again, integral constants will be omitted unless they are essential.

3.1. Explicit Formulas for p = ± 1 , r = 0 , r = 1 , and p + 2 r + 3 = 0

We first consider the cases in which direct evaluation of explicit formulas is possible.
Lemma 1. 
For r = 0 , we easily obtain
K p , 0 = ln | x | , p = 1 , x p + 1 p + 1 , p 1 .
Next, by combining the results shown in (7) and (16), we have
K 1 , r = 1 2 ln 1 + x 2 , r = 1 , 1 + x 2 r + 1 2 ( r + 1 ) , r 1
for p = 1 . Similarly, collecting the results shown in (8) and (12), we have
K p , p + 3 2 = 1 2 ln x 2 1 + x 2 , p = 1 , x p + 1 p + 1 1 + x 2 p + 1 2 , p 1
for p + 2 r + 3 = 0 .
Theorem 1. 
For p = 1 , as shown in (A7) of Appendix A.1, the explicit formulas for K 1 , r can be expressed as
K 1 , r = 1 2 ln v r ( x ) + k = 1 h 2 r + 1 h 2 r + 1 k v r k ( x ) k , r = 0 , ± 1 , , 1 2 ln 1 + x 2 1 1 + x 2 + 1 + k = 0 h 2 r + 1 1 2 1 + x 2 k 2 r + 1 s r k 2 r + 1 , r = ± 1 2 , ± 3 2 , ,
where h y = 1 2 ( | y | 1 ) , k y = h y k ,
v y ( x ) = x 2 , y = 0 , 1 , , x 2 1 + x 2 , y = 1 , 2 , ,
and
s y = 1 , y 0 , 1 , y < 0
denotes the sign of y: note that s 0 = 1 , not s 0 = 0 .
Example 3. 
With (24), we obtain K 1 , 2 = 1 2 ln v 2 ( x ) + 1 2 v 2 ( x ) = 1 2 ln x 2 1 + x 2 x 2 1 + x 2 , for instance.
Theorem 2. 
For r = 1 , the explicit formulas for K p , 1 can be expressed as
K p , 1 = s p 2 ( 1 ) h p + 1 2 2 tan 1 x s p + k = 1 h p + 1 2 ( 1 ) k p 1 2 k p + 1 x 2 ( k p + 1 ) s p , p = 0 , ± 2 , ± 4 , s p 2 ( 1 ) h p ln 1 + x 2 s p + k = 1 h p ( 1 ) k k h p k 1 + x 2 s p k , p = ± 1 , ± 3 ,
as shown in (A15) of Appendix A.2.
The results (21)–(24) and (27) allow us to obtain the explicit formulas for the integral K p , r for every point ( p , r ) Ω K in the five lines r = 0 , p = 1 , p + 2 r + 3 = 0 , p = 1 , and r = 1 , respectively. Figure 1 illustrates the five lines in which every point now has an explicit formula for the integral K p , r : three additional lines are also included based on the results later in this section.

3.2. Explicit Formulas when p + 2 r + 1 = 0

If { p + 2 r + 1 = 0 } { p = 1 } , we easily obtain K 1 , 0 = 1 x d x = ln | x | as discussed in (9) also. For { p + 2 r + 1 = 0 } { p 1 } , we can obtain K p , p + 1 2 from K p + 2 , p + 3 2 or vice versa for p = 0 , ± 1 , ± 2 , with the recursion
K p , p + 1 2 = x p + 1 p + 1 1 + x 2 p + 1 2 + K p + 2 , p + 3 2 ,
which can be derived from (10) or (15).
When using the recursion (28), two initial conditions, known formulas for K p , r in this paper, are required because the recursion describes a relationship between two K p , r ’s with a difference of 2 in the subscript p and we assume integers for p. In addition, due to the ‘wall’ effect that neither K 1 , 0 from K 1 , 1 nor K 1 , 1 from K 1 , 0 can be obtained when p = 1 caused by the factor p + 1 in the denominator on the right-hand side of (28), one additional initial condition is required.
In short, for the recursion (28), a complete set of three initial conditions would be K 1 , 1 , K 0 , 1 2 , K 1 , 0 , of which the first, second, and third elements can be replaced by any element from K 2 m 1 , m : m = 1 , 2 , , K 2 m , m 1 2 : m = 0 , ± 1 , ± 2 , , and K 2 m 1 , m : m = 0 , 1 , 2 , , respectively.
Now, by adding
K p , p + 1 2 = x p + 1 p + 1 1 + x 2 p + 1 2 + K p + 2 , p + 3 2 ,
K p + 2 , p + 3 2 = x p + 3 p + 3 1 + x 2 p + 3 2 + K p + 4 , p + 5 2 ,
K s 2 , s 1 2 = x s 1 s 1 1 + x 2 s 1 2 + K s , s + 1 2 ,
obtained from (28), we obtain
K p , p + 1 2 = K s , s + 1 2 + k = p : 2 s 2 x k + 1 k + 1 1 + x 2 k + 1 2
for s = p + 2 m with m a positive integer. It is easy to see that the result (32) can also be used for s = p + 2 m with m a negative integer after an interchange of the subscripts p and s. Subsequently, the initial conditions K 0 , 1 2 = ln x + 1 + x 2 from Example 1, K 1 , 1 = 1 2 ln 1 + x 2 from (7), and K 1 , 0 = ln | x | from (9) can be used to obtain K p , p + 1 2 recursively for p = ± 2 , ± 4 , , for p = 3 , 5 , , and for p = 3 , 5 , , respectively. These observations will lead us to the following theorem.
Theorem 3. 
The explicit formulas for K p , p + 1 2 can be obtained via
K p , p + 1 2 = v p , p + 1 2 ( x ) + k = L p , p + 1 2 : 2 U p , p + 1 2 w p , p + 1 2 , k ( x ) ,
where
L p , p + 1 2 = 0 , p = 0 , 2 , , 1 , p = 1 , 3 , , p , p = 1 , 2 ,
denotes the lower limit of the summation,
U p , p + 1 2 = p 2 , p = 1 , 2 , , 3 , p = 1 , 3 , , 2 , p = 0 , 2 , 4 ,
denotes the upper limit of the summation,
v p , p + 1 2 ( x ) = ln 1 + x 2 , p = 1 , 3 , , ln | x | , p = 1 , 3 , , ln x + 1 + x 2 , p = 0 , ± 2 , ± 4 , ,
and
w p , p + 1 2 , k ( x ) = s p k + 1 x k + 1 1 + x 2 k + 1 2
for the points ( p , r ) on the line p + 2 r + 1 = 0 .
Example 4. 
We obtain K 3 , 2 = 1 2 ln 1 + x 2 x 2 2 1 + x 2 , K 5 , 3 = 1 2 ln 1 + x 2 x 2 2 1 + x 2 x 4 4 1 + x 2 2 , K 2 , 3 2 = ln x + 1 + x 2 x 1 + x 2 , and K 2 , 1 2 = ln x + 1 + x 2 1 + x 2 x from (33). We also easily obtain K 3 , 1 = ln | x | 1 + x 2 2 x 2 and K 5 , 3 = ln | x | 1 + x 2 2 x 2 1 + x 2 2 4 x 4 .

3.3. Explicit Formulas on Other Points of ( p , r )

To obtain K p , r from K p , r 1 or vice versa at every admissible value r = 0 , ± 1 2 , ± 1 , except r = p + 1 2 when p is fixed, we can use
K p , r = x p + 1 1 + x 2 r p + 2 r + 1 + 2 r p + 2 r + 1 K p , r 1
shown in (13). Similarly, to obtain K p , r from K p 2 , r or vice versa at every admissible value p = 0 , ± 1 , ± 2 , except p = 2 r 1 when r is fixed, we can use
K p , r = x p 1 1 + x 2 r + 1 p + 2 r + 1 p 1 p + 2 r + 1 K p 2 , r
shown in (18).
The recursion (38) allows us to obtain K p , r from K p , r 1 and vice versa in general: however, when r = 0 and r = p + 1 2 , neither K p , r from K p , r 1 nor K p , r 1 from K p , r can be obtained. Based on this observation, we divide the points in Ω K into three groups such that r G p , L , r G p , B , and r G p , U , where G p , L = , r L 1 2 , G p , B = r L , r U 1 2 , and G p , U = r U , are called the group sets of r with r L = min p + 1 2 , 0 and r U = max p + 1 2 , 0 . Likewise, when obtaining K p , r from K p , r 1 and vice versa with (39), we define three group sets of p, G L , r = , p L 1 , G B , r = p L , p U 1 , and G U , r = p U , , where p L = min 2 r 1 , 1 and p U = max 2 r 1 , 1 .
Clearly, the two recursions (38) and (39) require initial conditions, the known formulas for K p , r : for instance, those on the admissible points in the six lines r = 0 , p = 1 , p = 1 , r = 1 , p + 2 r + 1 = 0 , and p + 2 r + 3 = 0 will naturally be the candidates as the initial conditions. Appendix A.7 provides more detailed discussion on the issue of initial conditions.

3.3.1. Derivation of K p , r via (38) for p 1 Fixed

Let
a p , r ( x ) = x p + 1 1 + x 2 r p + 2 r + 1
and
b p , r = 2 r p + 2 r + 1 .
Then, if we add
K p , r = a p , r ( x ) + b p , r K p , r 1
b p , r K p , r 1 = b p , r a p , r 1 ( x ) + b p , r b p , r 1 K p , r 2
b p , r b p , r 1 K p , r 2 = b p , r b p , r 1 a p , r 2 ( x ) + b p , r b p , r 1 b p , r 2 K p , r 3
K p , s + 1 m = s + 2 r b p , m = a p , s + 1 ( x ) m = s + 2 r b p , m + K p , s m = s + 1 r b p , m
we obtain
K p , r = k = s + 1 r a p , k ( x ) m = k + 1 r b p , m + K p , s m = s + 1 r b p , m
for r > s .
Now, note that m = k + 1 r b p , m = 2 k + 2 p + 2 k + 3 2 k + 4 p + 2 k + 5 2 r p + 2 r + 1 = ( 2 r ) ! ! ( p + 2 k + 1 ) ! ! ( p + 2 r + 1 ) ! ! ( 2 k ) ! ! = S ( p , r ) S ( p , k ) , where
S ( a , b ) = ( 2 b ) ! ! ( a + 2 b + 1 ) ! !
with the double factorial defined as
k ! ! = 1 , i f k = 2 , 1 , i f k = 1 , 0 , k ( k 2 ) ! ! , i f k = 1 , 2 , , ( k + 2 ) ! ! k + 2 , i f k = 3 , 4 , .
Some values of the double factorial k ! ! are shown in Table 1 for easy reference.
Theorem 4. 
For p 1 fixed, from (46) we obtain
K p , r = S ( p , r ) K p , s S ( p , s ) + k = s + 1 r a p , k ( x ) S ( p , k )
useful when calculating K p , r from the initial condition K p , s for s < r , and
K p , r = S ( p , r ) K p , s S ( p , s ) k = r + 1 s a p , k ( x ) S ( p , k )
useful when calculating K p , r from the initial condition K p , s for s > r .
Note that the two formulas (49) and (50) can be used when one of the three group sets G p , L , G p , B , and G p , U contains both r and s. Let us now describe how to obtain the integral K p , r for all admissible values of r except for r = p + 1 2 for a fixed value of p 1 based on (49) and (50). The procedures differ slightly depending on the value of p. First, when p is an even integer, we use the set of initial conditions { K p , r U , K p , r U 1 , K p , r L , K p , r L 1 } . Specifically, use (49) and the initial condition K p , r U to obtain K p , r for r = r U + 1 , r U + 2 , ; use (50) and the initial condition K p , r L 1 to obtain K p , r for r = r L 2 , r L 3 , ; use (49) and the initial condition K p , r L to obtain K p , r for r = r L + 1 , r L + 2 , ; and use (50) and the initial condition K p , r U 1 to obtain K p , r for r = r U 2 , r U 3 , . In effect, among the two sets K p , r U , K p , r U 1 and K p , r L , K p , r L 1 , one set is used when obtaining K p , r for r odd multiple of 1 2 and the other set for r even multiple of 1 2 .
On the other hand, when p is an odd integer, { K p , r U , K p , r U 1 , K p , r L , K p , } or { K p , r U , K p , r U 1 , K p , r L 1 , K p , } shall be used as the set of initial conditions, where denotes any odd multiple of 1 2 . Specifically, use the initial condition K p , r U in (49) for obtaining K p , r for r = r U + 1 , r U + 2 , and the initial condition K p , r L 1 in (50) for obtaining K p , r for r = r L 2 , r L 3 , : these two steps are the same as those in the case of even p described above. Next, use (49) and the initial condition K p , to obtain K p , r for r = + 1 , + 2 , and use (50) and the initial condition K p , to obtain K p , r for r = 1 , 2 , . Subsequently, to obtain K p , r for r r L , r L + 1 , , r U 1 , we may use (49) and the initial condition K p , r L to obtain K p , r in the increasing order of r = r L + 1 , r L + 2 , , r U 1 , or use (50) and initial condition K p , r U 1 to obtain K p , r in the decreasing order of r = r U 2 , r U 3 , , r L . Table 2 summarizes how K p , r on all admissible points can be obtained when the value of p 1 is fixed.
Example 5. 
In Appendix A.3, the result (22) is reconfirmed via the recursions (49) and (50) when p = 1 .
When p = 0 , we can obtain { K 0 , r : r = 1 , 2, }, { K 0 , r : r = 1 2 , 3 2 , } , K 0 , r : r = 2 , 3 , , and K 0 , r : r = 5 2 , 7 2 , with the initial conditions K 0 , 0 = d x = x , K 0 , 1 2 = ln x + 1 + x 2 , K 0 , 1 = tan 1 x , and K 0 , 3 2 = x 1 + x 2 , respectively. Then, after some steps by noting that S ( 0 , b ) = ( 2 b ) ! ! ( 2 b + 1 ) ! ! , we will obtain the following corollary.
Corollary 1. 
For p = 0 , the explicit formulas for K 0 , r can be expressed as
K 0 , r = ( 2 r ) ! ! ( 2 r + 1 ) ! ! v 0 , r ( x ) + k = L 0 , r U 0 , r w 0 , r , k ( x ) ,
where
v 0 , r ( x ) = x , r = 0 , 1 , , tan 1 x , r = 1 , 2 , , ln x + 1 + x 2 , r = 1 2 , 1 2 , , x 1 + x 2 , r = 3 2 , 5 2 , ,
w 0 , r , k ( x ) = s r ( 2 k 1 ) ! ! ( 2 k ) ! ! x 1 + x 2 k ,
L 0 , r = 1 , r = 1 , 2 , , 1 2 , r = 1 2 , 3 2 , , r + 1 , r = 0 , 1 2 , 1 , 3 2 ,
denotes the lower limit of the summation, and
U 0 , r = 1 , r = 1 , 2 , 3 2 , r = 1 2 , 3 2 , , r , r = 0 , 1 2 , 1 , 3 2 ,
denotes the upper limit of the summation.
Example 6. 
From (51), it is easy to see that K 0 , 1 = 2 ! ! 3 ! ! 1 + 1 ! ! 2 ! ! 1 + x 2 x = x 3 3 + x 2 , K 0 , 1 2 = 1 ! ! 2 ! ! ln x + 1 + x 2 + 0 ! ! 1 ! ! x 1 + x 2 1 2 = 1 2 x 1 + x 2 + ln x + 1 + x 2 , K 0 , 2 = tan 1 x ( 3 ) ! ! ( 2 ) ! ! x 1 + x 2 1 ( 4 ) ! ! ( 3 ) ! ! = 1 2 tan 1 x + x 1 + x 2 ,
K 0 , 3 2 = 3 ! ! 4 ! ! ln x + 1 + x 2 + 0 ! ! 1 ! ! x 1 + x 2 1 2 + 2 ! ! 3 ! ! x 1 + x 2 3 2 = 1 8 2 x 3 + 5 x 1 + x 2 + 3 ln x + 1 + x 2 ,
and K 0 , 5 2 = ( 5 ) ! ! ( 4 ) ! ! ( 2 ) ! ! ( 3 ) ! ! x 1 1 + x 2 + 1 2 1 + x 2 3 2 = 2 x 2 + 3 x 3 1 + x 2 3 2 .

3.3.2. Derivation of K p , r via (39) for r 1 Fixed

Theorem 5. 
For r 1 fixed, the explicit formulas for K p , r can be obtained via
K p , r = T ( p , r ) ( 1 ) p s 2 K s , r T ( s , r ) + k = s + 2 : 2 p ( 1 ) p k 2 a k 2 , r + 1 ( x ) T ( k , r )
and
K p , r = T ( p , r ) ( 1 ) p s 2 K s , r T ( s , r ) k = p + 2 : 2 s ( 1 ) p k 2 a k 2 , r + 1 ( x ) T ( k , r )
useful in the calculation of K p , r p = 0 , ± 1 , ± 2 , with the initial condition K s , r when s < p and s > p , respectively. Here,
T ( a , b ) = ( a 1 ) ! ! ( a + 2 b + 1 ) ! ! .
Theorem 5 can be proved by following steps similar to those leading to (49) and (50), and details are provided in Appendix A.4. The two formulas (57) and (58) can be used when one of the three group sets G L , r , G B , r , and G U , r contains both r and s. After a discussion similar to that in Section 3.3.1, we will obtain Table 3 as the details on evaluating K p , r for a fixed value of r 1 .
Corollary 2. 
For r = 1 2 , the explicit formulas for K p , 1 2 can be obtained via
K p , 1 2 = s p ( p 1 ) ! ! p ! ! v p , 1 2 ( x ) + k = L p , 1 2 : 2 U p , 1 2 w p , 1 2 , k ( x ) ,
where
L p , 1 2 = 2 , p = 0 , 2 , , 3 , p = 1 , 3 , , p + 2 , p = 1 , 2 , ,
U p , 1 2 = p , p = 0 , 1 , , 1 , p = 1 , 3 , , 2 , p = 2 , 4 , ,
v p , 1 2 ( x ) = ( 1 ) p 2 ln x + 1 + x 2 , p = 0 , 2 , , ( 1 ) p 1 2 1 + x 2 , p = 1 , 3 , , ( 1 ) p 2 ln 1 + x 2 1 | x | , p = 1 , 3 , , ( 1 ) p + 2 2 1 + x 2 x , p = 2 , 4 , ,
and
w p , 1 2 , k ( x ) = ( k 2 ) ! ! ( k 1 ) ! ! ( 1 ) p k 2 x k 1 1 + x 2
as shown in (A33) of Appendix A.5. Note that ln 1 + x 2 1 | x | = 1 2 ln 1 + x 2 1 1 + x 2 + 1 in (63).
Example 7. 
With (60), we can obtain K 3 , 1 2 = 1 3 x 2 2 1 + x 2 , K 5 , 1 2 = 1 15 3 x 4 4 x 2 + 8 1 + x 2 , K 2 , 1 2 = 1 2 ln x + 1 + x 2 + x 2 1 + x 2 , K 4 , 1 2 = 3 8 ln x + 1 + x 2 + x 8 2 x 2 3 1 + x 2 , K 4 , 1 2 = 1 + x 2 x ( 5 ) ! ! ( 4 ) ! ! ( 1 ) 2 2 1 + ( 1 ) 2 2 2 ( 4 ) ! ! ( 3 ) ! ! x 2 = 1 + x 2 3 x 3 2 x 2 1 , and K 6 , 1 2 = 1 + x 2 15 x 5 8 x 4 4 x 2 + 3 , for instance. We can also obtain K 3 , 1 2 = ( 4 ) ! ! ( 3 ) ! ! 1 ( 1 ) 3 + 1 2 1 2 ln 1 + x 2 1 1 + x 2 + 1 ( 1 ) 1 + 1 2 ( 3 ) ! ! ( 2 ) ! ! 1 + x 2 x 2 = 1 4 ln 1 + x 2 1 1 + x 2 + 1 1 + x 2 2 x 2 and K 5 , 1 2 = ( 6 ) ! ! ( 5 ) ! ! ( 1 ) 5 + 1 2 1 2 ln 1 + x 2 1 1 + x 2 + 1 + 1 + x 2 ( 1 ) 1 + 1 2 ( 3 ) ! ! ( 2 ) ! ! x 2 + ( 1 ) 1 + 3 2 ( 5 ) ! ! ( 4 ) ! ! x 4 = 3 16 ln 1 + x 2 1 1 + x 2 + 1 + 1 + x 2 8 x 4 3 x 2 2 .
Corollary 3. 
The explicit formulas for K p , 2 can be obtained via
K p , 2 = s p v p , 2 ( x ) + k = L p , 2 : 2 U p , 2 w p , 2 , k ( x ) ,
where
L p , 2 = 2 , p = 0 , 2 , , 5 , p = 1 , 3 , , p + 2 , p = 1 , 2 , ,
U p , 2 = 0 , p = 0 , 2 , 4 , , 1 , p = 1 , 3 , , p , p = 1 , 2 , ,
v p , 2 ( x ) = 1 2 1 + x 2 , p = 1 , ( 1 ) p + 2 2 p 1 2 tan 1 x + x 1 + x 2 , p = 0 , ± 2 , , s p ( 1 ) p + 1 2 p 1 4 ln 1 + x 2 s p | x | s p 1 x 2 1 + x 2 , p = 1 , ± 3 , ± 5 , ,
and
w p , 2 , k ( x ) = ( 1 ) p k 2 s p ( k 1 ) ( k 3 ) x k 1 1 + x 2
as shown in (A38) of Appendix A.6.
Example 8. 
From (65), we have K 5 , 2 = ln 1 + x 2 + x 2 1 + x 2 + x 4 2 1 + x 2 when p = 5 , K 3 , 2 = ln x 2 1 + x 2 + x 2 1 + x 2 1 2 x 2 1 + x 2 when p = 3 , K 2 , 2 = 1 2 tan 1 x x 1 + x 2 when p = 2 , and K 2 , 2 = 3 2 tan 1 x 3 x 2 + 2 2 x 1 + x 2 when p = 2 .
In summary, via the recursions (49), (50), (57), and (58), together with the formulas shown in (21)–(24), (27), (33), (51), (60), and (65), the explicit formulas for all admissible points can be obtained. Table 4 shows some of the explicit formulas for K p , r that can be obtained by the formulas derived in Section 2 and Section 3. In the meantime, if we want to obtain the explicit formula on one admissible point, the procedures described below can be adopted more conveniently.
Simplified Procedure to Obtain One Explicit Formula
To obtain K p D , r D , follow any of the two ways, W1 and W2.
W1. In the line p = p D , choose a value s such that s r D is a non-zero integer and K p D , s is known.
W1.1 If s < r D , obtain K p D , r D from (49) with p = p D , r = r D , and s the value chosen.
W1.2 If s > r D , obtain K p D , r D from (50) with p = p D , r = r D , and s the value chosen.
W2. In the line r = r D , choose a value s such that s p D is a non-zero even integer and K s , r D is known.
W2.1 If s < p D , obtain K p D , r D from (57) with p = p D , r = r D , and s the value chosen.
W2.2 If s > p D , obtain K p D , r D from (58) with p = p D , r = r D , and s the value chosen.
Example 9. 
As an example of the simplified procedure, let us obtain K p D , r D on the red point p D , r D = 2 , 3 2 shown in Figure 1.
(Via W1) In the line p = p D = 2 , among other possibilities, we can choose s = 1 2 for which K 2 , 1 2 = 1 x 1 + x 2 is available from Table 4. Then, noting that s = 1 2 > 3 2 = r D , we follow W1.2. Specifically, using (50) with p = p D = 2 , r = r D = 3 2 , and s = 1 2 , we obtain
K 2 , 3 2 = S 2 , 3 2 K 2 , 1 2 S 2 , 1 2 k = 1 2 1 2 a 2 , k ( x ) S ( 2 , k ) = ( 3 ) ! ! ( 4 ) ! ! ( 2 ) ! ! ( 1 ) ! ! 1 x 1 + x 2 ( 2 ) ! ! ( 1 ) ! ! 1 2 x 1 + x 2 = 2 x 2 + 1 x 1 + x 2
as shown in Example 2 also. We have used that S 2 , 3 2 = ( 3 ) ! ! ( 4 ) ! ! = 2 , S 2 , 1 2 = ( 1 ) ! ! ( 2 ) ! ! = 1 , and a 2 , 1 2 ( x ) = 1 2 x 1 + x 2 .
(Via W2) In the line r = r D = 3 2 , we can choose s = 0 for which K 0 , 3 2 = x 1 + x 2 is available from Example 1. Noting that s = 0 > 2 = p D , we will follow W2.2. Then, using (58) with p = p D = 2 , r = r D = 3 2 , and s = 0 , we obtain
K 2 , 3 2 = T 2 , 3 2 ( 1 ) 2 2 K 0 , 3 2 T 0 , 3 2 k = 0 : 2 0 ( 1 ) 2 k 2 a k 2 , 1 2 ( x ) T k , 3 2 = ( 3 ) ! ! ( 4 ) ! ! ( 2 ) ! ! ( 1 ) ! ! x 1 + x 2 + ( 2 ) ! ! ( 1 ) ! ! 1 2 x 1 + x 2 = 2 x 2 + 1 x 1 + x 2
by noting that T 2 , 3 2 = ( 3 ) ! ! ( 4 ) ! ! = 2 , T 0 , 3 2 = ( 1 ) ! ! ( 2 ) ! ! = 1 , and a 2 , 1 2 ( x ) = 1 2 x 1 + x 2 .

4. Conclusions

In this paper, we have addressed explicit formulas for the integral K p , r = x p 1 + x 2 r d x , where we have focused on the cases of integers for p and integral multiples of 1 2 for r. The cases p = ± 1 , r = 0 , r = 1 , and p + 2 r + 3 = 0 of the integral have first been obtained by direct calculations. For the remaining cases of the integral, including the special case of p + 2 r + 1 = 0 , explicit formulas for the integral have been obtained mostly via recursive formulas: for the recursions, the formulas obtained by direct calculations can be employed as the initial conditions. Detailed discussions on the issue of choosing the initial conditions have also been provided in the Appendix A. Some examples of the explicit formulas for the integral are tabulated.

Author Contributions

Conceptualization, I.S., S.R.P. and L.A.C.-N.; methodology, I.S., S.R.P. and L.A.C.-N.; software, I.S., S.R.P. and L.A.C.-N. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by an internal grant from the University of Electronic Science and Technology of China, Chengdu, Sichuan, China.

Data Availability Statement

The source code and the implementation of this study are available publicly in GitHub at https://github.com/varunkaza20/DAVis-Net (accessed on 16 August 2026). These data were derived from the following dataset available in the public domain at Kaggle: https://www.kaggle.com/datasets/nafeesalmahadi/oct2026-retinal-oct2017-balanced-701515-split (accessed on 1 May 2026).

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. Derivations of Formulas and Additional Discussions

Appendix A.1. The Case p = −1

First, the case ( p , r ) = ( 1 , 1 ) has already been addressed in (23). When { p = 1 } { r 1 } , we can use partial fraction expansion based on
K 1 , r = t 2 r + 1 t 2 1 d t ,
where t = 1 + x 2 . In addition, the formula
K 1 , r = 1 2 t r t 1 d t
from (5) with t = 1 + x 2 is more convenient than (A1) for r an even multiple of 1 2 , but less convenient for r an odd multiple of 1 2 .
First, for r = 0 , 1 , , we have K 1 , r = 1 2 t r t 1 d t = 1 2 ( v + 1 ) r d v v = 1 2 k = 0 r r k v k 1 d v with v = t 1 = x 2 from (A2). Thus,
K 1 , r = ln | x | + k = 1 r r k 2 k x 2 k .
Subsequently, for r = 1 , 2 , we have K 1 , r = 1 2 d t t q ( t 1 ) = 1 2 y q 1 y 1 d y with q = r , y = 1 t , and d t = d y y 2 from (A2). Thus, letting v = y 1 , we obtain K 1 , r = 1 2 y q 1 y 1 d y = 1 2 ln | v | + k = 1 q 1 q 1 k k v k or
K 1 , r = 1 2 ln x 2 1 + x 2 + k = 1 r 1 r 1 k 2 k x 2 1 + x 2 k .
When r = m + 1 2 for m = 0 , 1 , , using that t 2 m + 2 t 2 1 = t 2 m + t 2 m 2 + + 1 + 1 t 2 1 = k = 0 m t 2 ( m k ) + 1 2 t 1 + 1 2 t + 1 , we obtain K 1 , m + 1 2 = t 2 m + 2 t 2 1 d t or
K 1 , m + 1 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 + k = 0 m 1 + x 2 m k + 1 2 2 ( m k ) + 1
from (A1). Subsequently, when r = q + 1 2 for q = 1 , 2 , using (A1) we obtain K 1 , q + 1 2 = t 2 q + 2 t 2 1 d t = v 2 q 2 1 v 2 1 d v v 2 = v 2 q 2 v 2 1 d v = 1 2 ln 1 + x 2 1 1 + x 2 + 1 + k = 0 q 2 1 + x 2 q + k + 2 1 2 2 ( q 2 k ) + 1 or
K 1 , q + 1 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 k = 0 q 2 1 + x 2 q + k + 3 2 2 q + 2 k + 3
by replacing m and 1 + x 2 in (A5) with q 2 (from 2 m + 2 = 2 q 2 we obtain m = q 2 ) and 1 1 + x 2 , respectively.
Collecting the results (A3)–(A6), we have
K 1 , r = ln | x | + k = 1 r r k 2 k x 2 k , r = 0 , 1 , , 1 2 ln x 2 1 + x 2 + k = 1 r 1 r 1 k 2 k x 2 1 + x 2 k , r = 1 , 2 , , 1 2 ln 1 + x 2 1 1 + x 2 + 1 + k = 0 r 1 2 1 + x 2 r k 2 ( r k ) , r = 1 2 , 3 2 , , 1 2 ln 1 + x 2 1 1 + x 2 + 1 k = 0 r 3 2 1 + x 2 r + k + 1 2 ( r + k + 1 ) , r = 1 2 , 3 2 , .
Example A1. 
We obtain K 1 , 0 = ln | x | and K 1 , 1 = ln | x | + x 2 2 from (A3). From (A4), we obtain K 1 , 1 = 1 2 ln x 2 1 + x 2 and K 1 , 2 = 1 2 ln x 2 1 + x 2 x 2 2 1 + x 2 : the latter result can alternatively be obtained as K 1 , 2 = d t t 2 1 t 3 = 1 2 d q q + 1 2 q = 1 2 1 q + 1 q + 1 + 1 ( q + 1 ) 2 d q = 1 2 ln q q + 1 + 1 2 ( q + 1 ) or
K 1 , 2 = 1 2 ln x 2 1 + x 2 + 1 2 1 + x 2
with q = t 2 1 = x 2 from (A1). Note that the last term 1 2 1 + x 2 of (A8) is equivalent to the last term x 2 2 1 + x 2 of K 1 , 2 shown in Example 3 because x 2 2 1 + x 2 = 1 + x 2 1 2 1 + x 2 = 1 2 + 1 2 1 + x 2 . We also obtain K 1 , 1 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 + 1 + x 2 when m = 0 and K 1 , 3 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 + 1 3 1 + x 2 3 2 + 1 + x 2 when m = 1 from (A5) and K 1 , 1 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 when q = 1 and K 1 , 3 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 + 1 1 + x 2 when q = 2 from (A6).
In passing, let us note that a result equivalent to (A7) can be obtained via (14) alternatively. For example, by using (14) recursively and recollecting (9), we have K 1 , r = K 1 , 0 + 1 2 k = 1 r 1 k 1 + x 2 k or
K 1 , r = ln | x | + 1 2 k = 1 r 1 k 1 + x 2 k
for r = 0 , 1 , . The term k = 1 r 1 k 1 + x 2 k = k = 1 r 1 k j = 0 k k j x 2 j in (A9) can be expressed as k = 1 r 1 k j = 0 k k j x 2 j = k = 1 r 1 k j = 0 r k j x 2 j = j = 0 r x 2 j k = 1 r 1 k k j = j = 1 r x 2 j k = 1 r 1 j k 1 j 1 + x 0 k = 1 r 1 k = j = 1 r x 2 j 1 j t = 0 r 1 t j 1 + k = 1 r 1 k = j = 1 r x 2 j 1 j r j + k = 1 r 1 k : we have used that k j = 0 when the integers j and k satisfy j > k 0 from Table 1.4 in [22] and that t = 0 r t s = t = s r t s = r + 1 s + 1 from (1.E.22) in [22]. In essence, (A9) is equivalent to the first line on the right-hand side of (A7).

Appendix A.2. The Case r=-1

The cases ( p , r ) = ( 0 , 1 ) , ( 1 , 1 ) , and ( 1 , 1 ) have been addressed in Example 1. Let us next consider the remaining cases { p ± 1 , 0 } { r = 1 } . First, recollect that k = 1 m ( 1 ) k + 1 x 2 ( m k ) = ( 1 ) m + 1 1 x 2 1 x 2 m or
k = 1 m ( 1 ) k + 1 x 2 ( m k ) = ( 1 ) m + 1 + x 2 m 1 + x 2
and ( 1 ) m + 1 + ( 1 ) m = 0 for m = 1 , 2 , . Then, for p = 2 m with m = 1 , 2 , , we have K 2 m , 1 = x 2 m 1 + x 2 d x = k = 1 m ( 1 ) k + 1 x 2 ( m k ) + ( 1 ) m 1 + x 2 d x or
K 2 m , 1 = k = 1 m ( 1 ) k + 1 2 ( m k ) + 1 x 2 ( m k ) + 1 + ( 1 ) m tan 1 x
using (A10). Similarly, when p = 2 m with m = 1 , 2 , , we obtain K 2 m , 1 = x 2 m 1 + x 2 d x = y 2 m 1 + y 2 d y or
K 2 m , 1 = ( 1 ) m tan 1 1 x k = 1 m ( 1 ) k + 1 x 2 m + 2 k 1 2 ( m k ) + 1
with y = 1 x and d x = d y y 2 . Note that, when x = tan θ or θ = tan 1 x , we have tan 1 1 x = π 2 θ = tan 1 x + π 2 .
Secondly, for p = 2 m + 1 with m = 0 , 1 , , we have K 2 m + 1 , 1 = x 2 m + 1 1 + x 2 d x = 1 2 ( t 1 ) m t d t = 1 2 k = 0 m m k ( 1 ) m k t k 1 d t or
K 2 m + 1 , 1 = ( 1 ) m 2 ln 1 + x 2 + k = 1 m m k ( 1 ) m k 2 k 1 + x 2 k
from (5) with t = 1 + x 2 . Similarly, when p = 2 m 1 for m = 0 , 1 , , with y = 1 x and d x = d y y 2 , we obtain K 2 m 1 , 1 = d x x 2 m + 1 1 + x 2 = y 2 m + 1 1 + y 2 d y , which is basically the same as (A13) with x replaced by y. Thus,
K 2 m 1 , 1 = 1 2 ( 1 ) m + 1 ln 1 + x 2 x 2 + k = 1 m m k ( 1 ) m k + 1 2 k 1 + x 2 x 2 k .
Collecting the results (A11)–(A14), we obtain
K p , 1 = ( 1 ) p 2 tan 1 x + k = 1 p 2 ( 1 ) k + 1 p 2 k + 1 x p 2 k + 1 , p = 0 , 2 , , ( 1 ) p 2 tan 1 1 x k = 1 p 2 ( 1 ) k + 1 p 2 k + 1 1 x p 2 k + 1 , p = 2 , 4 , , 1 2 ( 1 ) p 1 2 ln 1 + x 2 + k = 1 p 1 2 ( 1 ) p 1 2 k 2 k p 1 2 k 1 + x 2 k , p = 1 , 3 , , 1 2 ( 1 ) | p | 1 2 ln 1 + x 2 x 2 + k = 1 | p | 1 2 ( 1 ) | p | 1 2 k + 1 2 k | p | 1 2 k 1 + x 2 x 2 k , p = 1 , 3 , .
The recursion (19) may alternatively be employed to obtain (A15). For example, by adding
K p , 1 = x p 1 p 1 K p 2 , 1 ( 1 ) K p 2 , 1 = ( 1 ) x p 3 p 3 ( 1 ) K p 4 , 1 ( 1 ) 2 K p 4 , 1 = ( 1 ) 2 x p 5 p 5 ( 1 ) 2 K p 6 , 1 ( 1 ) p s 2 K s , 1 = ( 1 ) p s 2 x s 1 s 1 ( 1 ) p s 2 K s 2 , 1 ,
we will obtain
K p , 1 = ( 1 ) p s 2 K s 2 , 1 + k = 2 : 2 p s + 2 ( 1 ) k 2 2 x p k + 1 p k + 1 .
It is easy to see that (A16), with s = 2 and K 0 , 1 = tan 1 x from Example 1, is equivalent to the first line on the right-hand side of (A15).
Example A2. 
Using (A11), it is easy to obtain K 2 , 1 = x tan 1 x , which can also be obtained as K 2 , 1 = 1 1 1 + x 2 d x . We obtain K 2 , 1 = 1 x + tan 1 1 x from (A12): this can also be derived as K 2 , 1 = 1 t 2 2 t 2 2 1 + t 2 d t = 1 2 1 2 t 2 + t 4 t 2 1 + t 2 d t = 1 2 1 + 3 t 2 + 1 t 2 1 + t 2 d t = 1 2 1 + 1 t 2 + 4 1 + t 2 d t = 1 2 t 1 t 4 tan 1 t = 1 2 1 t 2 t 2 θ = 1 2 2 tan θ 2 tan 1 x = 1 x tan 1 x . In addition, we obtain K 1 , 1 = 1 2 ln 1 + x 2 when m = 0 and K 3 , 1 = 1 2 1 + x 2 ln 1 + x 2 when m = 1 from (A13), and K 1 , 1 = 1 2 ln 1 + x 2 x 2 = 1 2 ln x 2 1 + x 2 when m = 0 and K 3 , 1 = 1 2 ln 1 + x 2 x 2 1 + x 2 2 x 2 when m = 1 from (A14).

Appendix A.3. The Case p=1

When p = 1 , with S ( 1 , k ) = ( 2 k ) ! ! ( 2 k + 2 ) ! ! = 1 2 k + 2 and a 1 , k ( x ) = x 2 1 + x 2 k 2 k + 2 , (49) and (50) can be expressed as K 1 , r = S ( 1 , r ) K 1 , s S ( 1 , s ) + k = s + 1 r a 1 , k ( x ) S ( 1 , k ) or
K 1 , r = 1 2 r + 2 ( 2 s + 2 ) K 1 , s + x 2 k = s + 1 r 1 + x 2 k
for s < r , and K 1 , r = S ( 1 , r ) K 1 , s S ( 1 , s ) k = r + 1 s a 1 , k ( x ) S ( 1 , k ) or
K 1 , r = 1 2 r + 2 ( 2 s + 2 ) K 1 , s x 2 k = r + 1 s 1 + x 2 k
for s > r , respectively. In addition, from p + 1 2 = 1 and r U = 0 , we can choose the set { K 1 , 0 , K 1 , 1 , K 1 , 1 2 , K 1 , 2 } of initial conditions.
Now, with s = 0 , S ( 1 , 0 ) = 1 2 , and the initial condition K 1 , 0 = x 2 2 from (21), we obtain K 1 , r = 1 2 r + 2 x 2 + x 2 k = 1 r 1 + x 2 k = x 2 2 r + 2 1 + 1 + x 2 1 1 + x 2 r 1 1 + x 2 or
K 1 , r = 1 + x 2 r + 1 1 2 ( r + 1 )
for r = 1 , 2 , from (A17). With s = 2 , S ( 1 , 2 ) = 1 2 , and the initial condition K 1 , 2 = x 2 2 1 + x 2 that can be obtained with (12), we obtain K 1 , r = 1 2 r + 2 2 K 1 , 2 x 2 k = r + 1 2 1 + x 2 k = 1 2 r + 2 x 2 1 + x 2 x 2 1 + x 2 r + 1 1 1 + x 2 r 2 1 1 + x 2 or
K 1 , r = 1 + x 2 r + 1 1 2 ( r + 1 )
for r = 3 , 4 , from (A18).
Similarly, with s = 1 2 , S 1 , 1 2 = 1 , and the initial condition K 1 , 1 2 = 1 + x 2 shown in Example 1, we obtain K 1 , r = 1 2 r + 2 1 + x 2 + x 2 k = 1 2 r 1 + x 2 k = 1 2 r + 2 1 + x 2 + x 2 1 + x 2 1 1 + x 2 r + 1 2 1 1 + x 2 or
K 1 , r = 1 + x 2 r + 1 2 ( r + 1 )
for r = 1 2 , 3 2 , from (A17). We can also obtain K 1 , r = 1 2 r + 2 1 + x 2 k = r + 1 1 2 x 2 1 + x 2 k = 1 2 r + 2 { 1 + x 2 x 2 1 + x 2 r + 1 1 1 + x 2 r 1 2 1 1 + x 2 } or
K 1 , r = 1 + x 2 r + 1 2 ( r + 1 )
for r = 3 2 , 5 2 , from (A18).
Combining the results (A19)–(A22), and noting (7), we easily see that the result is equivalent to (22).

Appendix A.4. Derivation of (uid79) and (uid80)

With c p , r ( x ) = a p 2 , r + 1 ( x ) = x p 1 p + 2 r + 1 1 + x 2 r + 1 and d p , r = p 1 p + 2 r + 1 , if we add
K p , r = c p , r ( x ) + d p , r K p 2 , r ,
d p , r K p 2 , r = d p , r c p 2 , r ( x ) + d p 2 , r d p , r K p 4 , r ,
d p , r d p 2 , r K p 4 , r = d p 2 , r d p , r c p 4 , r ( x ) + d p 4 , r d p 2 , r d p , r K p 6 , r ,
K s 2 , r m = s : 2 p d m , r = c s + 2 , r ( x ) m = s + 2 : 2 p d m , r + K s , r m = s + 2 : 2 p d m , r ,
we obtain
K p , r = k = s + 2 : 2 p c k , r ( x ) m = k + 2 : 2 p d m , r + K s , r m = s + 2 : 2 p d m , r
for p > s . Noting that m = k + 2 : 2 p d m , r = ( k + 1 ) k + 2 r + 3 ( k + 3 ) k + 2 r + 5 ( p 1 ) p + 2 r + 1 = ( 1 ) p k 2 ( p 1 ) ! ! ( p + 2 r + 1 ) ! ! ( k + 2 r + 1 ) ! ! ( k 1 ) ! ! can be rewritten as
m = k + 2 : 2 p d m , r = ( 1 ) p k 2 T ( p , r ) T ( k , r ) ,
we obtain (57) and (58) from (A27).

Appendix A.5. The Case r=-1 2

When r = 1 2 , we obtain 2 r 1 = 2 1 2 1 = 0 , p L = min ( 0 , 1 ) = 0 , p U = max ( 0 , 1 ) = 1 , c k , 1 2 ( x ) = 1 k x k 1 1 + x 2 1 2 , and T k , 1 2 = ( k 1 ) ! ! k ! ! . Let us choose the set { K 1 , 1 2 , K 2 , 1 2 , K 0 , 1 2 , K 1 , 1 2 } of initial conditions.
First, from (57), with s = 1 , T 1 , 1 2 = 0 ! ! 1 ! ! = 1 , and K 1 , 1 2 = 1 + x 2 shown in Example 1, we obtain K p , 1 2 = ( p 1 ) ! ! p ! ! { ( 1 ) p 1 2 1 + x 2 + k = 3 : 2 p ( 1 ) p k 2 c k , r ( x )   k ! ! ( k 1 ) ! ! } or
K p , 1 2 = ( p 1 ) ! ! p ! ! ( 1 ) p 1 2 1 + x 2 + 1 + x 2 k = 3 : 2 p ( 1 ) p k 2 ( k 2 ) ! ! ( k 1 ) ! ! x k 1
for p = 3 , 5 , and with s = 0 , T 0 , 1 2 = ( 1 ) ! ! 0 ! ! = 1 , and K 0 , 1 2 = ln x + 1 + x 2 shown in Example 1, we obtain
K p , 1 2 = ( p 1 ) ! ! p ! ! ( 1 ) p 2 ln x + 1 + x 2 + 1 + x 2 k = 2 : 2 p ( 1 ) p k 2 ( k 2 ) ! ! ( k 1 ) ! ! x k 1
for p = 2 , 4 , .
Next, from (58), with s = 2 , T 2 , 1 2 = ( 3 ) ! ! ( 2 ) ! ! = 1 , and K 2 , 1 2 = 1 x 1 + x 2 shown in Table 4, we obtain
K p , 1 2 = ( p 1 ) ! ! p ! ! ( 1 ) p + 2 2 1 + x 2 x + 1 + x 2 k = p + 2 : 2 2 ( 1 ) p k 2 ( k 2 ) ! ! ( k 1 ) ! ! x k 1
for p = 4 , 6 , and with s = 1 , T 1 , 1 2 = ( 2 ) ! ! ( 1 ) ! ! = 1 , and K 1 , 1 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 shown in Example 1, we obtain
K p , 1 2 = ( p 1 ) ! ! p ! ! ( 1 ) p + 1 2 2 ln 1 + x 2 1 1 + x 2 + 1 + 1 + x 2 k = p + 2 : 2 1 ( 1 ) p k 2 ( k 2 ) ! ! ( k 1 ) ! ! x k 1
for p = 3 , 5 , .
Collecting the results (A29)–(A32), we have
K p , 1 2 = ( p 1 ) ! ! p ! ! 1 + x 2 ( 1 ) p 1 2 + k = 3 : 2 p ( 1 ) p k 2 ( k 2 ) ! ! ( k 1 ) ! ! x k 1 , p = 1 , 3 , , ( p 1 ) ! ! p ! ! ( 1 ) p 2 ln x + 1 + x 2 + 1 + x 2 k = 2 : 2 p ( 1 ) p k 2 ( k 2 ) ! ! ( k 1 ) ! ! x k 1 , p = 0 , 2 , , ( p 1 ) ! ! p ! ! 1 + x 2 ( 1 ) p + 2 2 1 x + k = p + 2 : 2 2 ( 1 ) p k 2 ( k 2 ) ! ! ( k 1 ) ! ! x k 1 , p = 2 , 4 , , ( p 1 ) ! ! p ! ! 1 2 ( 1 ) p + 1 2 ln 1 + x 2 1 1 + x 2 + 1 + 1 + x 2 k = p + 2 : 2 1 ( 1 ) p k 2 ( k 2 ) ! ! ( k 1 ) ! ! x k 1 , p = 1 , 3 , .

Appendix A.6. The Case r=-2

When r = 2 , we obtain 2 r 1 = 3 , p L = 1 , p U = 3 , c p , 2 ( x ) = x p 1 ( p 3 ) 1 + x 2 , and T k , 2 = ( k 1 ) ! ! ( k 3 ) ! ! = k 1 . We can choose the initial conditions K 3 , 2 = 1 2 ln 1 + x 2 x 2 2 1 + x 2 from Example 4, K 1 , 2 = 1 2 ln x 2 1 + x 2 x 2 1 + x 2 from (24), K 1 , 2 = 1 2 1 + x 2 from (22), and K 0 , 2 = 1 2 tan 1 x + x 1 + x 2 from Example 6, where we have chosen 0 as ⊙.
First, from (57) with s = 3 , T ( 3 , 2 ) = 2 , and K 3 , 2 = 1 2 ln 1 + x 2 x 2 2 1 + x 2 , we obtain
K p , 2 = ( p 1 ) ( 1 ) p 3 2 4 ln 1 + x 2 x 2 1 + x 2 + 1 1 + x 2 k = 5 : 2 p ( 1 ) p k 2 x k 1 ( k 1 ) ( k 3 )
for p = 5 , 7 , . Second, from (58) with s = 1 , T ( 1 , 2 ) = 2 , and K 1 , 2 = 1 2 ln x 2 1 + x 2 x 2 2 1 + x 2 , we obtain
K p , 2 = ( p 1 ) ( 1 ) p + 1 2 4 ln x 2 1 + x 2 x 2 1 + x 2 1 1 + x 2 k = p + 2 : 2 1 ( 1 ) p k 2 x k 1 ( k 1 ) ( k 3 )
for p = 3 , 5 , .
Third, with the initial condition K 1 , 2 = 1 2 1 + x 2 , we do not have any other formula to obtain; this is a consequence of p L = p U 2 . Fourth, with the initial condition K 0 , 2 = 1 2 tan 1 x + x 1 + x 2 , we can obtain every formula for p even. Specifically, from (57) with s = 0 and T ( 0 , 2 ) = 1 , we obtain
K p , 2 = ( p 1 ) ( 1 ) p 2 2 tan 1 x + x 1 + x 2 + 1 1 + x 2 k = 2 : 2 p ( 1 ) p k 2 x k 1 ( k 1 ) ( k 3 )
for p = 2 , 4 , . Similarly, from (58) with s = 0 and T ( 0 , 2 ) = 1 , we obtain
K p , 2 = ( p 1 ) ( 1 ) p 2 2 tan 1 x + x 1 + x 2 1 1 + x 2 k = p + 2 : 2 0 ( 1 ) p k 2 x k 1 ( k 1 ) ( k 3 )
for p = 2 , 4 , .
Combining the results (A34)–(A37) above, we have
K p , 2 = 1 2 1 + x 2 , p = 1 , ( p 1 ) ( 1 ) p 3 2 4 ln 1 + x 2 x 2 1 + x 2 + 1 1 + x 2 k = 5 : 2 p ( 1 ) p k 2 x k 1 ( k 1 ) ( k 3 ) , p = 3 , 5 , , ( p 1 ) ( 1 ) p + 1 2 4 ln x 2 1 + x 2 x 2 1 + x 2 1 1 + x 2 k = p + 2 : 2 1 ( 1 ) p k 2 x k 1 ( k 1 ) ( k 3 ) , p = 1 , 3 , , ( p 1 ) ( 1 ) p 2 2 tan 1 x + x 1 + x 2 + 1 1 + x 2 k = 2 : 2 p ( 1 ) p k 2 x k 1 ( k 1 ) ( k 3 ) p = 0 , 2 , , ( p 1 ) ( 1 ) p 2 2 tan 1 x + x 1 + x 2 1 1 + x 2 k = p + 2 : 2 0 ( 1 ) p k 2 x k 1 ( k 1 ) ( k 3 ) , p = 2 , 4 , .

Appendix A.7. Initial Conditions for the Recursions (38) and (39)

From Figure 1, it is observed that, for p 1 fixed, there now exist five or six explicit formulas for K p , r available as the candidates of the initial conditions when using (38). Similarly, when using (39) for r 1 fixed, four or five explicit formulas for K p , r are available as the candidates for the initial conditions.

Appendix A.7.1. Initial Conditions for the Recursion (38)

To obtain K p , r with a fixed value of p 1 , we shall employ the recursion (38). For each point ( p , r ) with r in one of the three group sets G p , L = , r L 1 2 , G p , B = r L , r U 1 2 , and G p , U = r U , of r, we need two initial conditions because we have assumed integral multiples of 1 2 for r and the recursion (38) describes a relationship between two K p , r ’s with a difference of 1 in the subscript r. In the meantime, an initial condition with r an odd multiple of 1 2 for one of the three group sets can also be used in another set across a border r = r L or r = r U when the border is an integer. Likewise, an initial condition with r an integer can be used across a border when the border is an odd multiple of 1 2 : that is, two of the six initial conditions are redundant, and as a consequence, the number of elements for a complete set of initial conditions is at most four: refer to Appendix A.7.3 for more discussion.
Specifically, we would first choose K p , r U and K p , r L 1 . Next, if p + 1 2 is an odd multiple of 1 2 , or equivalently, if p is an even integer, it suffices to choose K p , r U 1 and K p , r L because one of r L and r U is 0 and the other p + 1 2 is an odd multiple of 1 2 . If p + 1 2 is an integer, on the other hand, both r L and r U are integers: then, we could choose K p , r U 1 , K p , or K p , r L , K p , as the remaining two initial conditions, where denotes any odd multiple of 1 2 as in Table 2. In short, a complete set of initial conditions for the recursion (38) is
I 1 , p = K p , r U , K p , r L 1 , K p , r U 1 , K p , r L , if p is an even integer , K p , r U , K p , r L 1 , K p , , K p , r L or K p , r U , K p , r L 1 , K p , r U 1 , K p , , if p is an odd integer .
In the set I 1 , p , the initial conditions K p , r U and K p , r L 1 can be replaced by any element of the sets K p , r U + m m = 0 and K p , r L m m = 1 , respectively. In addition, when p + 1 2 is an integer and an odd multiple of 1 2 , the initial condition K p , r U 1 can be replaced by any element of the sets K p , r U m m = 1 r U r L and K p , r U m m = 1 , respectively. Similarly, the initial condition K p , r L can be replaced by any element of the sets K p , r L + m m = 0 r U r L 1 and K p , r L + m m = 0 when p + 1 2 is an integer and an odd multiple of 1 2 , respectively. Note that r U r L = p + 1 2 = 1 2 | p + 1 | .

Appendix A.7.2. Initial Conditions for the Recursion (39)

To obtain K p , r with a fixed value of r 1 , we shall employ the recursion (39). Following steps similar to those in Appendix A.7.1, a complete set of initial conditions for the recursion (39) is
I 2 , r = K p U , r , K p L 2 , r , K p U 2 , r , K p L , r , if r is an odd multiple of 1 2 , K p U , r , K p L 2 , r , K , r , K p L , r or K p U , r , K p L 2 , r , K p U 2 , r , K , r , if r is an integer ,
where ⊙ denotes any even integer as in Table 3.
In the set I 2 , r , the initial conditions K p U , r and K p L 2 , r can be replaced by any element of the sets K p U + 2 m , r m = 0 and K p L 2 m , r m = 1 , respectively. Similarly, the initial condition K p U 2 , r can be replaced by any element of the sets K p U 2 m , r m = 1 and K p U 2 m , r m = 1 1 2 p U p L when 2 r 1 is an even and an odd integer, respectively. Likewise, the initial condition K p L , r can be replaced by any element of the sets K p L + 2 m , r m = 0 1 2 p U p L 1 and K p L + 2 m , r m = 0 when 2 r 1 is an odd and an even integer, respectively. Note that 1 2 p U p L = 1 2 2 r 1 1 = | r + 1 | .

Appendix A.7.3. Special Cases

Let us note that, although I 1 , 3 in effect contains only three elements because r L = r U 1 when p = 3 , it will still be a set of a sufficient number of initial conditions for solving the recursion (38). Similarly, when r = 2 , the set I 2 , 2 will still be a complete set for solving the recursion (39) although it contains only three elements because p L = p U 2 .
Note also that each of the two sets I 1 , 1 for p = 1 and I 2 , 1 for r = 1 contains only two elements because r L = r U = 0 and p L = p U = 1 , respectively: the number two of initial conditions will be insufficient for solving the recursions. Yet, when p = 1 and when r = 1 , the integral K p , r does not need to be calculated via recursions but can easily be obtained via direct evaluations as shown in (24) and (27), respectively.

References

  1. Abramowitz, M.; Stegun, I.A. (Eds.) Handbook of Mathematical Functions; Dover: New York, NY, USA, 1972. [Google Scholar]
  2. Gradshteyn, I.S.; Ryzhik, I.M. Table of Integrals, Series, and Products, 7th ed.; Academic Press: Burlington, MA, USA, 2007. [Google Scholar]
  3. Heck, A.; Koepf, W. Introduction to Maple; Springer: New York, NY, USA, 1993. [Google Scholar]
  4. Morrison, M.; Hastings, C.; Mischo, K. Hands-on Start to Wolfram Mathematica; Wolfram Media: Champaign, IL, USA, 2015. [Google Scholar]
  5. Geddes, K.O.; Czapor, S.R.; Labahn, G. Algorithms for Computer Algebra; Kluwer Academic Publishers: Boston, MA, USA, 1992. [Google Scholar]
  6. Rich, A.; Scheibe, P.; Abbasi, N.M. Rule-based integration: An extensive system of symbolic integration rules. J. Open Source Softw. 2018, 3, 1073. [Google Scholar] [CrossRef] [Scilit]
  7. Beukers, F. Gauss’ hypergeometric function. Prog. Math. 2007, 260, 23–42. [Google Scholar] [CrossRef] [Scilit]
  8. Kohl, K.T.; Moll, V.H. The integrals in Gradshteyn and Ryzhik. Part 20: Hypergeometric functions. Sci. Ser. A Math. Sci. 2011, 21, 43–54. [Google Scholar]
  9. Jayarama, P.; Lim, D.; Rathie, A.K.; Kilicman, A. Evaluation of certain definite integrals involving generalized hypergeometric functions. Axioms 2024, 13, 887. [Google Scholar] [CrossRef] [Scilit]
  10. Remiddi, E.; Vermaseren, J.A.M. Harmonic polylogarithms. Int. J. Mod. Phys. A 2000, 15, 725–754. [Google Scholar] [CrossRef] [Scilit]
  11. Kölbig, K.S. Two infinite integrals of products of modified Bessel functions and powers of logarithms. J. Comput. Appl. Math. 1995, 62, 41–65. [Google Scholar] [CrossRef] [Scilit]
  12. Kalmykov, M.Y.; Ward, B.F.L.; Yost, S. All order ε-expansion of Gauss hypergeometric functions with integer and half/integer values of parameters. J. High Energy Phys. 2007, 2007, 40. [Google Scholar] [CrossRef] [Scilit]
  13. Panzer, E. Feynman Integrals and Hyperlogarithms. Ph.D. Dissertation, Humboldt University of Berlin, Berlin, Germany, 2015. [Google Scholar]
  14. Artico, D.; Magnea, L. Integration-by-parts identities and differential equations for parametrised Feynman integrals. J. High Energy Phys. 2024, 2024, 96. [Google Scholar] [CrossRef] [Scilit]
  15. Hu, C.; Feng, B.; Shen, J.; Zhang, Y. General one-loop generating function by integration-by-part relations. Phys. Rev. D 2025, 111, 076026. [Google Scholar] [CrossRef] [Scilit]
  16. Boyadzhiev, K.N. A binomial formula for evaluating integrals. Discret. Math. Lett. 2022, 10, 51–55. [Google Scholar] [CrossRef] [Scilit]
  17. Byrd, P.F.; Friedman, M.D. Handbook of Elliptic Integrals for Engineers and Scientists, 2nd ed.; Springer: New York, NY, USA, 1971. [Google Scholar]
  18. Chebyshev, P.L. Sur l’intégration des différentielles irrationnelles. J. Mathématiques Pures Appliqués 1853, 18, 87–111. [Google Scholar]
  19. Stewart, J.; Clegg, D.K.; Watson, S. Calculus: Early Transcendentals, 9th ed.; Cengage: Boston, MA, USA, 2020. [Google Scholar]
  20. Coffey, M.W. Integrals in Gradshteyn and Ryzhik: Hyperbolic and trigonometric function. arXiv 2018, arXiv:1803.00632. [Google Scholar]
  21. Santaella Forero, R.; Mendoza Suárez, R.; López Carreño, J.C. A new way to evaluate Lobachevsky’s integrals. Int. J. Math. Math. Sci. 2025, 2025, 3918563. [Google Scholar] [CrossRef] [Scilit]
  22. Song, I.; Park, S.R.; Yoon, S. Probability and Random Variables: Theory and Applications; Springer: Berlin/Heidelberg, Germany, 2022. [Google Scholar]
Figure 1. For the three points ( 1 , 1 ) , ( 1 , 0 ) , and ( 1 , 1 ) (in black) and the admissible points in the eight lines p = 1 , p = 0 , p = 1 , r = 0 , r = 1 2 , r = 1 , r = 2 , and p + 2 r + 3 = 0 (in blue), as well as the admissible points in the exceptional recurrence line p + 2 r + 1 = 0 (in red), explicit formulas for K p , r can be found in the equations specified. The explicit formulas are obtained via recursion on the admissible points in the three thinner blue lines p = 0 , r = 1 2 , and r = 2 : on other points, the explicit formulas are obtained directly. The red point ( 2 , 1.5 ) is for use in Example 9 at the end of Section 3.
Figure 1. For the three points ( 1 , 1 ) , ( 1 , 0 ) , and ( 1 , 1 ) (in black) and the admissible points in the eight lines p = 1 , p = 0 , p = 1 , r = 0 , r = 1 2 , r = 1 , r = 2 , and p + 2 r + 3 = 0 (in blue), as well as the admissible points in the exceptional recurrence line p + 2 r + 1 = 0 (in red), explicit formulas for K p , r can be found in the equations specified. The explicit formulas are obtained via recursion on the admissible points in the three thinner blue lines p = 0 , r = 1 2 , and r = 2 : on other points, the explicit formulas are obtained directly. The red point ( 2 , 1.5 ) is for use in Example 9 at the end of Section 3.
Mca 31 00191 g001
Table 1. Some values of k ! ! .
Table 1. Some values of k ! ! .
k 9876543210
k ! ! 945384105481583211
k 1 2 3 4 5 6 7 8 9
k ! ! 1 1 1 1 2 1 3 1 8 1 15 1 48 1 105
Table 2. Evaluation of K p , r for all admissible values of r when p 1 is fixed.
Table 2. Evaluation of K p , r for all admissible values of r when p 1 is fixed.
Value of pwith Initial ConditionVia FormulaCalculate K p , r for
p   is   even K p , r U (49) r = r U + 1 , r U + 2 ,
K p , r L 1 (50) r = r L 2 , r L 3 ,
K p , r U 1 (50) r = r U 2 , r U 3 ,
K p , r L (49) r = r L + 1 , r L + 2 ,
p   is   odd K p , r U (49) r = r U + 1 , r U + 2 ,
K p , r L 1 (50) r = r L 2 , r L 3 ,
K p , (49) r = + 1 , + 2 ,
K p , (50) r = 1 , 2 ,
K p , r U 1 (50) r = r U 2 , r U 3 , , r L
K p , r L (49) r = r L + 1 , r L + 2 , , r U 1
Among the last two sets of calculations, only one set is necessary
Note: r L = min p + 1 2 , 0 . r U = max p + 1 2 , 0 . = any odd multiple of 1 2 .
Table 3. Evaluation of K p , r for all admissible values of p when r 1 is fixed.
Table 3. Evaluation of K p , r for all admissible values of p when r 1 is fixed.
Value of rwith Initial ConditionVia FormulaCalculate K p , r for
r   is   an   odd multiple   of   1 2 K p U , r (57) p = p U + 2 , p U + 4 ,
K p L 2 , r (58) p = p L 4 , p L 6 ,
K p U 2 , r (58) p = p U 4 , p U 6 ,
K p L , r (57) p = p L + 2 , p L + 4 ,
r   is   an   even multiple   of 1 2 K p U , r (57) p = p U + 2 , p U + 4 ,
K p L 2 , r (58) p = p L 4 , p L 6 ,
K , r (57) p = + 2 , + 4 ,
K , r (58) p = 2 , 4 ,
K p U 2 , r (58) p = p U 4 , p U 6 , , p L
K p L , r (57) p = p L + 2 , p L + 4 , , p U 2
Among the last two sets of calculations, only one set is necessary
Note: p L = min 2 r 1 , 1 . p U = max 2 r 1 , 1 . = any even integer.
Table 4. Explicit formulas for K p , r = x p 1 + x 2 r d x . Here, ‘ = e ’ denotes ‘equivalent to’, α = K 0 , 1 2 = ln x + 1 + x 2 , β = K 1 , 1 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 = ln 1 + x 2 1 | x | , and g 3 2 ( x ) = 2 x 3 + 5 x 1 + x 2 .
Table 4. Explicit formulas for K p , r = x p 1 + x 2 r d x . Here, ‘ = e ’ denotes ‘equivalent to’, α = K 0 , 1 2 = ln x + 1 + x 2 , β = K 1 , 1 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 = ln 1 + x 2 1 | x | , and g 3 2 ( x ) = 2 x 3 + 5 x 1 + x 2 .
p = 2 p = 1 p = 0 p = 1 p = 2
Equation (24) Equation (51) Equation (22)
r = 5 2 4 x 2 x 2 + 3 3 1 + x 2 3 2 β + 1 1 + x 2 x 2 x 2 + 3 3 1 + x 2 3 2 1 3 1 + x 2 3 2 x 3 3 1 + x 2 3 2
1 x 1 + x 2 3 2 + 1 3 1 + x 2 3 2
r = 2 3 2 tan 1 x 1 2 ln x 2 1 + x 2 1 2 tan 1 x x 2 2 1 + x 2 1 2 tan 1 x
Equation (65) 3 x 2 + 2 2 x 1 + x 2 1 2 x 2 1 + x 2 + 1 2 x 1 + x 2 1 2 x 1 + x 2
r = 3 2 2 x + 1 x β x 1 + x 2 1 1 + x 2 α
× 1 1 + x 2 + 1 1 + x 2 x 1 + x 2
r = 1 1 x 1 2 ln x 2 1 + x 2 tan 1 x 1 2 ln 1 + x 2 x
Equation (27) tan 1 x tan 1 x
r = 1 2 1 + x 2 x β α 1 + x 2 x 3 + x 2 1 + x 2
Equation (60) 1 2 α
r = 0 1 x ln | x | x x 2 2 x 3 3
Equation (21)
r = 1 2 α β 1 2 α 1 3 1 + x 2 3 2 2 x 5 + 3 x 3 + x 8 1 + x 2
1 + x 2 x + 1 + x 2 + x 2 1 + x 2 1 8 α
r = 1 1 x + x ln | x | + x 2 2 x + x 3 3 x 2 2 + x 4 4 x 3 3 + x 5 5
= e 1 4 1 + x 2 2
r = 3 2 3 α 2 + 1 2 g 3 2 ( x ) β + 2 1 + x 2 3 α 8 + 1 + x 2 5 2 5 α 16 1 48 g 3 2 ( x )
1 + x 2 5 2 x + 2 3 1 + x 2 3 2 1 8 g 3 2 ( x ) + x 6 1 + x 2 5 2
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.

Share and Cite

MDPI and ACS Style

Song, I.; Park, S.R.; Caceres-Najarro, L.A. Evaluation of a Subclass Kp,r = ∫xp(1 + x2)rdx of the Binomial Integral. Math. Comput. Appl. 2026, 31, 191. https://doi.org/10.3390/mca31050191

AMA Style

Song I, Park SR, Caceres-Najarro LA. Evaluation of a Subclass Kp,r = ∫xp(1 + x2)rdx of the Binomial Integral. Mathematical and Computational Applications. 2026; 31(5):191. https://doi.org/10.3390/mca31050191

Chicago/Turabian Style

Song, Iickho, So Ryoung Park, and Lismer Andres Caceres-Najarro. 2026. "Evaluation of a Subclass Kp,r = ∫xp(1 + x2)rdx of the Binomial Integral" Mathematical and Computational Applications 31, no. 5: 191. https://doi.org/10.3390/mca31050191

APA Style

Song, I., Park, S. R., & Caceres-Najarro, L. A. (2026). Evaluation of a Subclass Kp,r = ∫xp(1 + x2)rdx of the Binomial Integral. Mathematical and Computational Applications, 31(5), 191. https://doi.org/10.3390/mca31050191

Article Metrics

Back to TopTop