1 Introduction and outline
There are many infinite series representations for
$\pi $
and related mathematical constants (see [Reference Borwein and Borwein2, Reference Chan and Liaw3, Reference Chu7, Reference Chu9, Reference Chu and Campbell10, Reference Elsner13, Reference Lehmer17, Reference Zucker22]). Recently, by employing computer algebra, Guillera [Reference Guillera14–Reference Guillera16] discovered several marvellous evaluations of Ramanujan-like series [Reference Ramanujan19]. Two beautiful examples are
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu1.png?pub-status=live)
These two identities and further similar ones have been proved uniformly by means of the hypergeometric series approach (see [Reference Chu6, Reference Chu8, Reference Chu and Zhang11]). The same approach has been used to examine analogous series involving harmonic numbers (see [Reference Chu5, Reference Chu7, Reference Chu9, Reference Chu and Campbell10, Reference Wang and Chu21]). We evaluate several challenging series involving harmonic numbers and quintic central binomial coefficients in closed form, including five experimentally conjectured by Sun [Reference Sun20] (see (2.5), (2.6), (2.9), (2.10), (3.2)). Five representative examples are
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu2.png?pub-status=live)
To facilitate the subsequent presentation, we briefly review basic facts about harmonic numbers, the
$\Gamma $
-function and the ‘coefficient extraction’ method.
1.1 Harmonic numbers
For
$x\in \mathbb {R}$
and
$n \in \mathbb {N}_0$
, these numbers are defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu3.png?pub-status=live)
When
$\lambda =1$
and/or
$x=1$
, they will be suppressed from the notation. We record also the following simple, but useful relations:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu4.png?pub-status=live)
1.2 The Gamma function
It is defined by the Euler integral (see [Reference Rainville18, Section 8]),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu5.png?pub-status=live)
with its quotient form being abbreviated to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu6.png?pub-status=live)
As usual, denote the Riemann zeta function and the Euler–Mascheroni constant by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu7.png?pub-status=live)
Then we have power series expansions of the
$\Gamma $
-function [Reference Chu5]:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqn1.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqn2.png?pub-status=live)
where
$\sigma _k$
and
$\tau _k$
are defined respectively by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu8.png?pub-status=live)
1.3 Coefficient extraction
For an indeterminate x, the rising factorials are
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu9.png?pub-status=live)
Let
$[x^m]\varphi (x)$
stand for the coefficient of
$x^m$
in the formal power series
$\varphi (x)$
. By means of the generating function method, it is not difficult to show (see [Reference Chen and Chu4, Reference Chu7, Reference Chu8]):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqn3.png?pub-status=live)
Here ‘
$\text {hh}_k$
’ stands for the harmonic number
$\text {hh}_k:=\mathbf {H}_{n}^{\scriptscriptstyle \langle {k}\rangle }(\lambda )$
of order k, and the Bell polynomials [Reference Comtet12, Section 3.3] are expressed explicitly as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqn4.png?pub-status=live)
The multiple sum on the right runs over
$\omega (m)$
, the set of all m-partitions represented by m-tuples
$(\ell _1,\ell _2,\ldots ,\ell _m)\in \mathbb {N}_0^m$
subject to the condition
$\sum _{k=1}^m k\ell _k=m$
.
By applying the ‘coefficient extraction’ method (see [Reference Chu5, Reference Chu7, Reference Chu9, Reference Chu and Campbell10, Reference Wang and Chu21]) to the two hypergeometric series transformations due to Chu and Zhang [Reference Chu and Zhang11], we shall establish several new infinite series identities involving harmonic numbers and quintic central binomial coefficients. In the next section, this approach will be illustrated by deducing identities from one of these transformations. Then in Section 3, more infinite series evaluations will be presented by examining the other transformation.
2 Sample series with harmonic numbers of lower orders
For
$\{a,b,c,d,e\}\in \mathbb {C}$
subject to the condition
$\text {Re}(1+2a-b-c-d-e)>0$
, Chu and Zhang [Reference Chu and Zhang11, Theorem 10] discovered the transformation formula
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqn5.png?pub-status=live)
where the cubic polynomial
$\mathcal {U}_n(a,b,c,d,e)$
is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu10.png?pub-status=live)
By specifying
$e=a$
in (2.1) and assuming the condition
$\text{Re}(1+a-b-c-d)>0$
, we derive, by making use of Dougall’s summation theorem for the very well-poised
$_5F_4$
-series [Reference Bailey1, Section 4.4], the summation formula
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqn6.png?pub-status=live)
where the cubic polynomial
$\mathrm {U}_n(a,b,c,d)$
is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu11.png?pub-status=live)
The parameter restriction
$\text {Re}(1+a-b-c-d)>0$
can be removed by analytic continuation. The formula holds in the whole complex space of dimension 4 except for the hyperplanes determined by
$\{b-a\in \mathbb {N}\} \cup \{c-a\in \mathbb {N}\} \cup \{d-a\in \mathbb {N}\} \cup \{b+c+d-a\in \mathbb {N}\},$
which is also covered by the convergence domain of the infinite series.
Now we are going to illustrate how to use (2.2) and then (2.1) to derive infinite series identities involving harmonic numbers and quintic central binomial coefficients.
2.1 Quintic central binomial coefficients in numerators
Under the parameter replacements
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu12.png?pub-status=live)
the summation formula in (2.2) becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqn7.png?pub-status=live)
where the cubic polynomial
$\mathcal {P}_n(a,b,c,d;x)$
is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu13.png?pub-status=live)
Observe that both sides of equation (2.3) are analytic in x in the neighbourhood of
$x=0$
. By means of (1.1) and (1.2), the
$\Gamma $
-function quotient on the left-hand side can be expanded into a Maclaurin series. The same can be done for the right-hand side via (1.3) and (1.4). By comparing the coefficients
$\mathrm {A}_m(a,b,c,d)$
of
$x^m$
across the resulting series, we can establish the following infinite series identities.
-
•
$\boxed {\mathrm {A}_0(a,b,c,d)}$ Guillera [Reference Guillera16] (see also [Reference Chu8, Reference Chu and Zhang11]):
(2.4)$$ \begin{align} \frac8{\pi^2}=\sum_{n=0}^{\infty} \frac{\binom{2n}{n}^5}{(-2^{12})^n} \{1+8n+20n^2\}.\end{align} $$
-
•
$\boxed {\mathrm {A}_1(1,1,0,0)}$ Conjectured by Sun [Reference Sun20, (4.15)]
(2.5)$$ \begin{align}\frac{16\ln2}{\pi^2}=\sum_{n=0}^{\infty} \frac{\binom{2n}{n}^5}{(-2^{12})^n} \{(1+6n)-(1+8n+20n^2)\mathbf{H}_{n}\}.\end{align} $$
-
•
$\boxed {\mathrm {A}_1(3,3,2,2)}$
$$ \begin{align*}\frac{16\ln2}{\pi^2}=\sum_{n=0}^{\infty} \frac{\binom{2n}{n}^5}{(-2^{12})^n} \{(3+10n)+10(1+8n+20n^2)\mathbf{O}_{n}\}.\end{align*} $$
Linear combinations of the above two series yield two further series below, where the first one was experimentally conjectured by Sun [Reference Sun20, (4.16)]:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqn9.png?pub-status=live)
-
•
$\boxed {\mathrm {A}_2(1+\mathbf {i},0,1,\mathbf {i})}$
-
•
$\boxed {\mathrm {A}_2(3,7,\sqrt {19}\mathbf {i},-\sqrt {19}\mathbf {i})}$
-
•
$\boxed {3\mathrm {A}_3(1,1,\mathbf {i},-\mathbf {i})+2\mathrm {A}_3(0,1,-2,1)}$
-
•
$\boxed {3\mathrm {A}_3(2,0,1+\mathbf {i},1-\mathbf {i})-2\mathrm {A}_3(0,1,-2,1)}$
Among these series, the first and also the simplest was discovered by Guillera [Reference Guillera16] using computer algebra. For the hypergeometric series approach, more identities of Ramanujan type are systematically reviewed in [Reference Chu8, Reference Chu and Zhang11].
2.2 Quintic central binomial coefficients in denominators
Alternatively, under the parameter setting
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu20.png?pub-status=live)
the transformation corresponding to (2.1) can be simplified into
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqn10.png?pub-status=live)
where the cubic polynomial
$\mathcal {Q}_n=\mathcal {Q}_n(a,b,c,d,e;x)$
is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu21.png?pub-status=live)
Since both sides of (2.7) are analytic in x in the neighbourhood of
$x=0$
, we can expand them into Maclaurin series. Even though the series on the left does not admit a closed form expression, we do succeed, by extracting the coefficients
$\mathrm {B}_m(a,b,c,d,e)$
of
$x^m$
across the resulting series, in recovering Guillera’s elegant formula (2.8), confirming two conjectured identities (2.9) and (2.10) made very recently by Sun [Reference Sun20], and finding further elegant and difficult evaluation formulae involving har monic numbers of higher order. They are represented by the following ten examples.
-
•
$\boxed {\mathrm {B}_0(a,b,c,d,e)}$ Guillera [Reference Guillera16] (see also [Reference Chu8, Reference Chu and Zhang11])
(2.8)$$ \begin{align} -28\zeta(3)=\sum_{n=1}^{\infty} \frac{(-2^8)^{n}}{n^5\binom{2n}{n}^5} \{1-6 n+10 n^2\}.\end{align} $$
-
•
$\boxed {\mathrm {B}_1(2,1,1,1,1)}$ Conjectured by Sun [Reference Sun20, (4.6)]
(2.9)$$ \begin{align} -\frac{\pi^4}{2}=\sum_{n=1}^{\infty} \frac{(-2^8)^{n}}{n^5\binom{2n}{n}^5} \{2(1-6 n+10 n^2)\mathbf{O}_{n}+(1-3n)\}.\end{align} $$
-
•
$\boxed {\mathrm {B}_2(0,0,0,1,-1)}$ Conjectured by Sun [Reference Sun20, (4.8)]
(2.10)$$ \begin{align} 62\zeta(5)=\sum_{n=1}^{\infty} \frac{(-2^8)^{n}}{n^5\binom{2n}{n}^5} \{(1-6 n+10 n^2)(\mathbf{H}_{n-1}^{\scriptscriptstyle\langle{2}\rangle}-2\mathbf{O}_{n}^{\scriptscriptstyle\langle{2}\rangle})+1\}.\end{align} $$
-
•
$\boxed {\mathrm {B}_2(2,1,1,1,1)}$
-
•
$\boxed {\mathrm {B}_3(2,1,1,1,1)}$
-
•
$\boxed {\mathrm {B}_3(0,0,1,1,-2)}$
(2.11)$$ \begin{align} -98\zeta^2(3) =\sum_{n=1}^{\infty} \frac{(-2^8)^{n}}{n^5\binom{2n}{n}^5} \bigg\{\frac{1}{n}+4(1-6 n+10 n^2)\mathbf{O}_{n}^{\scriptscriptstyle\langle{3}\rangle}\bigg\}.\end{align} $$
We remark that the above closed form expression is not obtained directly from (2.7) under the parameter setting
$\mathrm {B}_3(0,0,1,1,-2)$
. In this case, the corresponding left-hand side results in another series, which can be simplified (apart from a constant factor) by symmetry as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu24.png?pub-status=live)
By carrying out analogous operations, we can evaluate four further series in closed form.
-
•
$\boxed {\mathrm {B}_4(0,1,-1,-\mathbf {i},\mathbf {i})}$
(2.12)$$ \begin{align}-127\zeta(7)=\sum_{n=1}^{\infty} \frac{(-2^8)^{n}}{n^5\binom{2n}{n}^5} (1-6 n+10 n^2)(\mathbf{H}_{n-1}^{\scriptscriptstyle\langle{4}\rangle}+4\mathbf{O}_{n}^{\scriptscriptstyle\langle{4}\rangle}).\end{align} $$
-
•
$\boxed {\mathrm {B}_5(0,0,1,1,-2)}$
-
•
$\boxed {\mathrm {B}_6(0,1-\sqrt {2}\mathbf {i},1+\sqrt {2}\mathbf {i},-1,-1)}$
-
•
$\boxed {\mathrm {B}_7(0,1-\sqrt {2}\mathbf {i},1+\sqrt {2}\mathbf {i},-1,-1)}$
3 Further series with harmonic numbers of higher orders
Chu and Zhang [Reference Chu and Zhang11, Theorem 9] give another transformation analogous to (2.1). For
$\{a,b,c,d,e\}\in \mathbb {C}$
subject to
$\text {Re}(1+2a-b-c-d-e)>0$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu28.png?pub-status=live)
where the cubic polynomial
$\mathcal {V}_n(a,b,c,d,e)$
is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu29.png?pub-status=live)
Letting
$e=a$
in this equality and assuming the condition
$\text {Re}(1+a-b-c-d)>0$
, we derive, again by making use of Dougall’s summation theorem for the well-poised
$_5F_4$
-series [Reference Bailey1, Section 4.4], the following summation formula:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqn16.png?pub-status=live)
where the cubic polynomial
$\mathrm {V}_n(a,b,c,d)$
is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu30.png?pub-status=live)
As with (2.2), the parameter restriction
$\text {Re}(1+a-b-c-d)>0$
can be removed by analytic continuation. The formula is valid in the whole complex space of dimension 4 except for the hyperplanes determined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu31.png?pub-status=live)
3.1 Quintic central binomial coefficients in numerators
Performing the parameter replacements
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu32.png?pub-status=live)
the summation formula in (3.1) becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu33.png?pub-status=live)
where the cubic polynomial
$\mathrm {P}_n(a,b,c,d;x)$
is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu34.png?pub-status=live)
By expanding both sides of the above equation into Maclaurin series and then comparing the coefficients
$\mathrm {C}_m(a,b,c,d)$
of
$x^m$
, we can deduce several infinite series identities. Ten representative examples are recorded as follows.
-
•
$\boxed {\mathrm {C}_2(0,1,-1,0)}$ Conjectured by Sun [Reference Sun20, (4.19)]
(3.2)$$ \begin{align} \frac83=\sum_{n=0}^{\infty} \frac{\binom{2n}{n}^5}{(-2^{12})^n} \bigg\{4-(1+8n+20n^2)(\mathbf{H}_{n}^{\scriptscriptstyle\langle{2}\rangle}-8\mathbf{O}_{n}^{\scriptscriptstyle\langle{2}\rangle})\bigg\}.\end{align} $$
-
•
$\boxed {\mathrm {C}_3(2,2,1,1)}$
(3.3)$$ \begin{align}\frac{64\zeta(3)}{\pi^2}=\sum_{n=0}^{\infty} \frac{\binom{2n}{n}^5}{(-2^{12})^n} \bigg\{\frac{8}{1+2n}+(1+8n+20n^2)\mathbf{H}_{n}^{\scriptscriptstyle\langle{3}\rangle}\bigg\}.\end{align} $$
-
•
$\boxed {\mathrm {C}_4(1+\mathbf {i},2,0,2\mathbf {i})}$
(3.4)$$ \begin{align}-\frac{56\pi^2}{45}=\sum_{n=1}^{\infty} \frac{\binom{2n}{n}^5}{(-2^{12})^n} \bigg\{(1+8n+20n^2)(\mathbf{H}_{n}^{\scriptscriptstyle\langle{4}\rangle}+64\mathbf{O}_{n}^{\scriptscriptstyle\langle{4}\rangle})\bigg\}.\end{align} $$
-
•
$\boxed {\mathrm {C}_5(2,2,1,1)}$
-
•
$\boxed {\mathrm {C}_6(1,4,-1+3\mathbf {i},-1-3\mathbf {i})}$
$$ \begin{align*}\frac{512\zeta^2(3)}{\pi^2}-\frac{496\pi^4}{945} =\sum_{n=1}^{\infty} \frac{\binom{2n}{n}^5}{(-2^{12})^n} \bigg\{\frac{16\mathbf{H}_{n}^{\scriptscriptstyle\langle{3}\rangle}}{1+2n}+(1+8n+20n^2) [\mathbf{H}_{n}^{\scriptscriptstyle\langle{6}\rangle}+(\mathbf{H}_{n}^{\scriptscriptstyle\langle{3}\rangle})^2-128\mathbf{O}_{n}^{\scriptscriptstyle\langle{6}\rangle}]\bigg\}.\end{align*} $$
-
•
$\boxed {\mathrm {C}_7(1,4,-1+3\mathbf {i},-1-3\mathbf {i})}$
$$ \begin{align*}&\frac{1024 \zeta(7)}{\pi^2}-\frac{448\pi^2 \zeta (3)}{45}\\ &\quad=\sum_{n=1}^{\infty}\frac{\binom{2n}{n}^5}{(-2^{12})^n} \bigg\{\frac{8(\mathbf{H}_{n}^{\scriptscriptstyle\langle{4}\rangle}+64\mathbf{O}_{n}^{\scriptscriptstyle\langle{4}\rangle})}{1+2n} +(1+8n+20n^2)[\mathbf{H}_{n}^{\scriptscriptstyle\langle{3}\rangle}(\mathbf{H}_{n}^{\scriptscriptstyle\langle{4}\rangle}+64\mathbf{O}_{n}^{\scriptscriptstyle\langle{4}\rangle})+\mathbf{H}_{n}^{\scriptscriptstyle\langle{7}\rangle}]\bigg\}. \end{align*} $$
-
•
$\boxed {\mathrm {C}_8(1+\mathbf {i},2,0,2\mathbf {i})}$
$$ \begin{align*}-\frac{304 \pi ^6}{14175} =\sum_{n=1}^{\infty}\frac{\binom{2n}{n}^5}{(-2^{12})^n} \bigg\{(1+8n+20n^2)[(\mathbf{H}_{n}^{\scriptscriptstyle\langle{4}\rangle}+64\mathbf{O}_{n}^{\scriptscriptstyle\langle{4}\rangle})^2+\mathbf{H}_{n}^{\scriptscriptstyle\langle{8}\rangle}-4096\mathbf{O}_{n}^{\scriptscriptstyle\langle{8}\rangle}]\bigg\}.\end{align*} $$
-
•
$\boxed {\mathrm {C}_9(1,4,-1+3\mathbf {i},-1-3\mathbf {i})}$
$$ \begin{align*}&\frac{8192 \zeta (9)}{\pi ^2} \!+\!\frac{4096 \zeta^3(3)}{\pi ^2} \!-\!\frac{3968 \pi ^4 \zeta (3)}{315} =\sum_{n=1}^{\infty} \frac{\binom{2n}{n}^5}{(-2^{12})^n} \bigg\{\frac{24[\mathbf{H}_{n}^{\scriptscriptstyle\langle{6}\rangle}+(\mathbf{H}_{n}^{\scriptscriptstyle\langle{3}\rangle})^2-128\mathbf{O}_{n}^{\scriptscriptstyle\langle{6}\rangle}]}{1+2n}\\ &\qquad+(1+8n+20n^2)[2\mathbf{H}_{n}^{\scriptscriptstyle\langle{9}\rangle}+(\mathbf{H}_{n}^{\scriptscriptstyle\langle{3}\rangle})^3 +3\mathbf{H}_{n}^{\scriptscriptstyle\langle{3}\rangle}\mathbf{H}_{n}^{\scriptscriptstyle\langle{6}\rangle}-384\mathbf{H}_{n}^{\scriptscriptstyle\langle{3}\rangle}\mathbf{O}_{n}^{\scriptscriptstyle\langle{6}\rangle}]\bigg\}. \end{align*} $$
-
•
$\boxed {\mathrm {C}_{12}(1+\mathbf {i},2,0,2\mathbf {i})}$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu40.png?pub-status=live)
-
•
$\boxed {\mathrm {C}_{20}(1+\mathbf {i},2,0,2\mathbf {i})}$
$$ \begin{align*}-\frac{986692736 \pi ^{18}}{714620417135625} =\sum_{n=1}^{\infty}\binom{2n}{n}^5 \frac{1+8n+20n^2}{(-2^{12})^n} \mathrm{W}_{20}(n),\end{align*} $$
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu42.png?pub-status=live)
3.2 Quintic central binomial coefficients in denominators
Alternatively, under the parameter setting
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu43.png?pub-status=live)
we derive from (3.1) the transformation formula
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqn20.png?pub-status=live)
where the cubic polynomial
$\mathrm {Q}_n(a,b,c,d;x)$
is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu44.png?pub-status=live)
According to this transformation formula, numerous infinite series identities can be obtained by extracting the coefficients
$\mathrm {D}_m(a,b,c,d)$
of
$x^m$
across the equation. We are going to highlight seventeen remarkable ones below. Among them, the first four identities are derived from (3.5) after multiplying across by
$\tfrac 12+ax$
. The remaining ones are directly obtained from (3.5) by comparing coefficients.
-
•
$\boxed {\mathrm {D}_4(\mathbf {i},2,-2,2\mathbf {i})}$
$$ \begin{align*}-8=\sum_{n=1}^{\infty} \frac{(-2^8)^n}{\binom{2n}{n}^5} \bigg\{\frac{1+10 n+40 n^2+80 n^3+88 n^4+40 n^5}{n^4(2n+1)^5}\bigg\}.\end{align*} $$
-
•
$\boxed {\mathrm {D}_5(2,2,1+\sqrt {3}\mathbf {i},1-\sqrt {3}\mathbf {i})}$
$$ \begin{align*}-8=\sum_{n=1}^{\infty} \frac{(-2^8)^n}{\binom{2n}{n}^5} \bigg\{\frac{1+10 n+40 n^2+80 n^3+80 n^4+40 n^5}{n^5(2n+1)^5}\bigg\}.\end{align*} $$
-
•
$\boxed {\mathrm {D}_4(1,1,1,-2)}$
$$ \begin{align*}\frac{\pi ^4}{8}-8=\sum_{n=1}^{\infty} \frac{(-2^8)^n}{\binom{2n}{n}^5} \bigg\{\frac{8+10n}{(2n+1)^5} -\frac{(1+8n+24n^2+20n^3)\mathbf{O}_{n}}{n^3(2n+1)^4}\bigg\}.\end{align*} $$
-
•
$\boxed {\mathrm {D}_5(\mathbf {i},2,-2,2\mathbf {i})}$
$$ \begin{align*}31\zeta (5)-28=\sum_{n=1}^{\infty} \frac{(-2^8)^n}{\binom{2n}{n}^5} \bigg\{\frac{4(7+10n)}{(2n+1)^6} +\frac{(1+8n+24n^2+20n^3)(\mathbf{H}_{n}^{\scriptscriptstyle\langle{2}\rangle}-2\mathbf{O}_{n}^{\scriptscriptstyle\langle{2}\rangle})}{n^3(2n+1)^4}\bigg\}.\end{align*} $$
$$ \begin{align*}\rule{99mm}{0.25mm}\end{align*} $$
-
•
$\boxed {\mathrm {D}_8(2,2,1+\sqrt {3}\mathbf {i},1-\sqrt {3}\mathbf {i})}$
(3.6)$$ \begin{align} 14\zeta (3)\{8-7\zeta (3)\} =\sum_{n=1}^{\infty}\frac{(-2^8)^n}{\binom{2n}{n}^5} \frac{1+4 n(1+6n+10n^2)\mathbf{O}_{n+1}^{\scriptscriptstyle\langle{3}\rangle}}{n^6 (2n+1)^4}.\end{align} $$
-
•
$\boxed {\mathrm {D}_3(1+\mathbf {i},2,0,2\mathbf {i})}$
(3.7)$$ \begin{align} 12-14\zeta(3)=\sum_{n=1}^{\infty} \frac{(-2^8)^n}{\binom{2n}{n}^5} \frac{1+8n+24n^2+20n^3}{n^3(2n+1)^4}.\end{align} $$
-
•
$\boxed {\mathrm {D}_4(1+\mathbf {i},2,0,2\mathbf {i})}$
(3.8)$$ \begin{align} 14\zeta(3)-20=\sum_{n=1}^{\infty} \frac{(-2^8)^n}{\binom{2n}{n}^5} \frac{1+9 n+30 n^2+40 n^3+20 n^4}{n^4(2n+1)^5}.\end{align} $$
-
•
$\boxed {\mathrm {D}_5(1+\mathbf {i},2,0,2\mathbf {i})=\mathrm {D}_6(1+\mathbf {i},2,0,2\mathbf {i})}$
(3.9)$$ \begin{align} 16-14\zeta(3)=\sum_{n=1}^{\infty} \frac{(-2^8)^n}{\binom{2n}{n}^5} \frac{1+6 n+10 n^2}{2n^5(2n+1)^4}.\end{align} $$
$$ \begin{align*}\rule{99mm}{0.25mm}\end{align*} $$
-
•
$\boxed {\mathrm {D}_7(1,1+\mathbf {i},0,1-\mathbf {i})}$
(3.10) -
•
$\boxed {\mathrm {D}_8(1,1+\mathbf {i},0,1-\mathbf {i})}$
(3.11) -
•
$\boxed {\mathrm {D}_9(1,1+\mathbf {i},0,1-\mathbf {i})=\mathrm {D}_{10}(1,1+\mathbf {i},0,1-\mathbf {i})}$
(3.12)$$ \begin{align} 127\zeta(7)+112\zeta (3)-256 =\sum_{n=1}^{\infty}\frac{(-2^8)^n}{\binom{2n}{n}^5} \bigg\{\frac{(1+6 n+10 n^2)(1-n^4\mathbf{H}_{n}^{\scriptscriptstyle\langle{4}\rangle} -4n^4\mathbf{O}_{n+1}^{\scriptscriptstyle\langle{4}\rangle})}{n^9(2n+1)^4}\bigg\}.\end{align} $$
$$ \begin{align*}\rule{99mm}{0.25mm}\end{align*} $$
-
•
$\boxed {\mathrm {D}_{11}(1+\mathbf {i},2,0,2\mathbf {i})}$
(3.13) -
•
$\boxed {\mathrm {D}_{12}(1+\mathbf {i},2,0,2\mathbf {i})}$
(3.14) -
•
$\boxed {\mathrm {D}_{13}(1+\mathbf {i},2,0,2\mathbf {i})=\mathrm {D}_{14}(1+\mathbf {i},2,0,2\mathbf {i})}$
(3.15)$$ \begin{align*}\rule{99mm}{0.25mm}\end{align*} $$
-
•
$\boxed {\mathrm {D}_{15}(1,1+\mathbf {i},0,1-\mathbf {i})}$
(3.16) -
•
$\boxed {\mathrm {D}_{16}(1,1+\mathbf {i},0,1-\mathbf {i})}$
(3.17) -
•
$\boxed {\mathrm {D}_{17}(1,1+\mathbf {i},0,1-\mathbf {i})=\mathrm {D}_{18}(1,1+\mathbf {i},0,1-\mathbf {i})}$
(3.18)
Observing these series carefully, we find a curious fact. Among the four groups
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu53.png?pub-status=live)
the three series in each group have almost the same value apart from integer differences.
We uncovered an explanation of this phenomenon by examining (3.5). Switching the initial term with
$n=0$
to the left-hand side, dividing across by ‘
$-c$
’ and then letting
$c\to 0$
, we can write, after some simplifications, the resulting transformation as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqn34.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqn35.png?pub-status=live)
the reduced cubic polynomial
$\mathrm {W}_n(a,b,d;x)$
is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu54.png?pub-status=live)
and the digamma function [Reference Rainville18, Section 9] is defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu55.png?pub-status=live)
Now it is trivial to check that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu56.png?pub-status=live)
For
$m>0$
, we can determine the coefficient
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu57.png?pub-status=live)
Then, apart from a rational constant, the coefficient of
$[x^m]$
in (3.19) is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu58.png?pub-status=live)
This leads to the explicit formula
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu59.png?pub-status=live)
where for the sake of brevity, we introduce the symbol
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu60.png?pub-status=live)
In particular, it is routine to check that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu61.png?pub-status=live)
where
$\chi $
stands for the logical function with
$\chi (\text {true})=1$
and
$\chi (\text {false})=0$
, and
$i\equiv _4j$
means ‘i is congruent to j modulo 4’ for
$i,j\in \mathbb {Z}$
.
Then for
$m\in \mathbb {N}$
and
$\ell =0,\pm 1,2$
, we can write explicitly
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu62.png?pub-status=live)
Making the replacement
$k\to 4k-2$
, we derive the simplified formula
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu63.png?pub-status=live)
Since the above sum is independent of
$\ell $
, we conclude that for any fixed
$m\in \mathbb {N}$
, the four linear sums (corresponding to
$\ell =0,\pm 1,2$
) of zeta values for
$\mathrm {D}_{4m+\ell }(1,1+\mathbf {i},0,1-\mathbf {i})$
are proportional, despite complexities of the sums on another side involving combined products of Bell polynomials of harmonic numbers. Analogously, we assert that the same statement is also true for
$\mathrm {D}_{4m+\ell }(1+\mathbf {i},2,0,2\mathbf {i})$
, which can be justified by the following particular values:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240310235339576-0436:S0004972723000618:S0004972723000618_eqnu64.png?pub-status=live)