Several properties of hypergeometric Bernoulli numbers

Abstract

In this paper, we give several characteristics of hypergeometric Bernoulli numbers, including several identities for hypergeometric Bernoulli numbers which the convergents of the continued fraction expansion of the generating function of the hypergeometric Bernoulli numbers entail. We show an analog of Kummer’s congruences in the classical Bernoulli numbers. We also give some determinant expressions of hypergeometric Bernoulli numbers and some relations between the hypergeometric and the classical Bernoulli numbers. By applying Trudi’s formula, we have some different expressions and inversion relations.

Introduction

Denote ${}_{1} F_{1}(a;b;z)$ be the confluent hypergeometric function defined by

$$ {}_{1} F_{1}(a;b;z)=\sum_{n=0}^{\infty } \frac{(a)^{(n)}}{(b)^{(n)}}\frac{z ^{n}}{n!} $$

with the rising factorial $(x)^{(n)}=x(x+1)\cdots (x+n-1)$ ($n\ge 1$) and $(x)^{(0)}=1$. For $N\ge 1$, define hypergeometric Bernoulli numbers $B_{N,n}$ [13,14,15,16, 18] by

$$ \frac{1}{{}_{1} F_{1}(1;N+1;x)}=\frac{x^{N}/N!}{e^{x}-\sum_{n=0}^{N-1}x ^{n}/n!}=\sum_{n=0}^{\infty }B_{N,n} \frac{x^{n}}{n!}. $$

(1)

When $N=1$, $B_{1,n}=B_{n}$ are the classical Bernoulli numbers, defined by

$$ \frac{x}{e^{x}-1}=\sum_{n=0}^{\infty }B_{n} \frac{x^{n}}{n!}. $$

In addition, define hypergeometric Bernoulli polynomials $B_{N,n}(z)$ [17] by the generating function

$$ \frac{e^{x z}}{{}_{1} F_{1}(1;N+1;x)}=\sum_{n=0}^{\infty }B_{N,n}(z) \frac{x ^{n}}{n!}. $$

It is well known [25] that

$$ \sum_{m=0}^{n}\binom{n}{m}B_{1,m}(x)B_{2,n-m}(y)=B_{2,n}(x+y)- \frac{n}{2}B_{1,n-1}(x+y) \quad (n\ge 1). $$

(2)

Many kinds of generalizations of the Bernoulli numbers have been considered by many authors. For example, poly-Bernoulli numbers [20], multiple Bernoulli numbers [5], Apostol–Bernoulli numbers [23], multi-poly-Bernoulli numbers [10, 11], degenerate Bernoulli numbers [6], various types of q-Bernoulli numbers [4], Bernoulli–Carlitz numbers [3]. One of the advantages of hypergeometric numbers is the natural extension of determinant expressions of the numbers.

In [22], some determinant expressions of hypergeometric Cauchy numbers are considered. In this paper, first we show a similar determinant expression of hypergeometric Bernoulli numbers and their generalizations. Then we study some relations between the hypergeometric Bernoulli numbers and the classical Bernoulli numbers which include Kummer’s congruences. Furthermore, by applying Trudi’s formula, we also have some different expressions and inversion relations. Finally, we determine explicit forms of the convergents of the continued fraction expansion of the generating function of the hypergeometric Bernoulli numbers, from which several identities for hypergeometric Bernoulli numbers are given.

Some basic properties of hypergeometric Bernoulli numbers

In this section, we list some basic properties of hypergeometric Bernoulli numbers.

Proposition 1

Let $N,n\ge 1$. We have

$$\begin{aligned} &\sum_{m=0}^{n}\binom{N+n}{m}B_{N,m}=0, \end{aligned}$$

(3)

$$\begin{aligned} &B_{N,n}=n!\sum_{k=1}^{n} \sum _{{i_{1}+\cdots +i_{k}=n\atop i_{1},\dots,i_{k}\ge 1}}\frac{(-N!)^{k}}{(N+i _{1})!\cdots (N+i_{k})!}, \end{aligned}$$

(4)

$$\begin{aligned} &B_{N,n}=n!\sum_{k=1}^{n} \binom{n+1}{k+1} \sum_{{i_{1}+\cdots +i_{k}=n\atop i_{1},\dots,i_{k}\ge 0}}\frac{(-N!)^{k}}{(N+i _{1})!\cdots (N+i_{k})!}. \end{aligned}$$

(5)

Remark

When $N=1$ in (3), we have a famous identity for Bernoulli numbers,

$$ \sum_{m=0}^{n}\binom{n+1}{m}B_{m}=0\quad (n\ge 1). $$

In some literature (e.g., [20]), the Bernoulli numbers $\mathfrak{B}_{n}$ are also defined by

$$ \frac{x}{1-e^{-x}}=\sum_{n=0}^{\infty } \mathfrak{B}_{n} \frac{x^{n}}{n!}. $$

Then we have

$$ \sum_{m=0}^{n}\binom{n+1}{m} \mathfrak{B}_{m}=n+1 \quad (n\ge 1) $$

(see, e.g., [1]). Notice that $B_{n}=(-1)^{n}\mathfrak{B} _{n}$ ($n\ge 0$).

By the identity (3), we get

$$ B_{N,n}=-\sum_{k=0}^{n-1} \frac{\binom{N+n}{k}}{\binom{N+n}{n}}B_{N,k} $$

with $B_{N,0}=1$ ($N\ge 1$). So, we have the exact forms of $B_{N,n}$ for small n one by one. For larger or general n, we need the identity (4).

In a later section about Trudi’s formula, we shall see a different expression of $B_{N,n}$ in Corollary 2. Further, an inversion expression can be obtained:

$$ \binom{N+n}{N}^{-1}=\sum_{k=1}^{n}(-1)^{k} \sum_{{i_{1}+\cdots +i_{k}=n\atop i_{1},\dots,i_{k}\ge 1}}\binom{n}{i _{1},\dots,i_{k}}B_{N,i_{1}}\cdots B_{N,i_{k}}, $$

where $\binom{n}{t_{1}, \dots,t_{k}}= \frac{n!}{t_{1} !\cdots t_{k} !}$ are the multinomial coefficients.

Proof of Proposition 1.

From the definition in (1), we have

$$\begin{aligned} \frac{x^{N}}{N!} &= \Biggl(\sum_{i=0}^{\infty } \frac{x^{i+N}}{(i+N)!} \Biggr) \Biggl(\sum_{m=0}^{\infty }B_{N,m} \frac{x^{m}}{m!} \Biggr) \\ &=x^{N}\sum_{n=0}^{\infty }\sum _{m=0}^{n}\frac{x^{n-m}}{(n-m+N)!}B _{N,m} \frac{x^{m}}{m!} \\ &=\sum_{n=0}^{\infty }\sum _{m=0}^{n}\frac{B_{N,m}}{(n-m+N)!m!}x^{N+n} . \end{aligned}$$

Hence, for $n\ge 1$, we have (3).

The proof of (4) can be done by induction on n. Here, we shall prove directly by using the generating function. From the definition in (1), we have

$$\begin{aligned} \sum_{n=0}^{\infty }B_{N,n} \frac{x^{n}}{n!} &=\frac{x^{N}/N!}{e^{x}- \sum_{i=0}^{N-1}x^{i}/i!} \\ &=\frac{1}{\frac{N!}{x^{N}}(e^{x}-\sum_{i=0}^{N} x^{i}/i!)+1} =\sum_{k=0}^{\infty } \Biggl(- \frac{N!}{x^{N}} \Biggl(e^{x}-\sum_{i=0} ^{N}\frac{x^{i}}{i!} \Biggr) \Biggr)^{k}. \end{aligned}$$

The identity (4) immediately follows by comparing coefficients of both sides.

The identity (5) is a different expression of $B_{N,n}$ with binomial coefficients. The proof is similar to that of (4) and is omitted. □

Analog of Kummer’s congruence

In this section, we show an analog of Kummer’s congruences in the classical Bernoulli numbers. Let p be a prime number, and $\nu \geq 0$ be an integer. For a non-zero integer m, we define the p-adic order ${\mathrm{ord}}_{p}(m)$ $(\in \mathbb{Z})$ of m by $m=up^{{\mathrm{ord}}_{p}(m)}$ where u is an integer satisfying $p \nmid u$. If m and n are positive even integers with $m\equiv n\ {(\operatorname{mod}(p-1)p^{\nu })}$ and $m,n \not \equiv 0\ {(\operatorname{mod} p-1)}$, then we have

$$ \bigl(1-p^{m-1}\bigr)\frac{B_{m}}{m} \equiv \bigl(1-p^{n-1}\bigr)\frac{B_{n}}{n}\quad {\bigl(\operatorname{mod} p^{\nu +1}\bigr)}, $$

(6)

and this is called Kummer’s congruence [30, Corollary 5.14]. We get the similar congruence for hypergeometric Bernoulli numbers $B_{N,n}$ for a special case that N is p-adically close enough to 1, that is, ${\mathrm{ord}}_{p}(N-1)$ is large enough compared to ν and the order of $\prod_{k=0}^{ {\mathrm{max}} \{ m,n \}} (1+k)!$.

We need the following lemma in order to prove the main result.

Lemma 1

Let p be a prime number. For $N\geq 1$ and $n\geq 0$, we have

$$ \prod_{k=0}^{n} \frac{(N+k)!}{N!} B_{N,n} \equiv \prod_{k=0}^{n} (1+k)! B_{n}\quad {\bigl(\operatorname{mod} p^{t}\bigr)}, $$

where $t={\mathrm{ord}}_{p}(N-1)$.

Proof

In the case $n=0$, the assertion is trivial. Assume that the result is true up to $n-1$. By Proposition 1, we have

$$\begin{aligned} \prod_{k=0}^{n} \frac{(N+k)!}{N!} B_{N,n} &= n! \prod_{k=0}^{n-1} \frac{(N+k)!}{N!} \times \Biggl\{ -\sum_{m=0}^{n-1} \binom{N+n}{m} B _{N,m} \Biggr\} \\ &=-\sum_{m=0}^{n-1} n! \binom{N+n}{m} \prod_{k=m+1}^{n-1} \frac{(N+k)!}{N!} \times \prod_{k=0}^{m} \frac{(N+k)!}{N!} B_{N,m} \\ &\equiv -\sum_{m=0}^{n-1} n! \binom{N+n}{m} \prod_{k=m+1}^{n-1} \frac{(N+k)!}{N!} \times \prod_{k=0}^{m} (1+k)! B_{m}\quad {\bigl(\operatorname{mod} p^{t}\bigr)} \\ &\equiv -\prod_{k=0}^{n-1} (1+k)! \times n! \sum_{m=0}^{n-1} \binom{n+1}{m} B_{m}\quad {\bigl(\operatorname{mod} p^{t}\bigr)} \\ &=\prod_{k=0}^{n} (1+k)! B_{n} \quad{\bigl(\operatorname{mod} p^{t}\bigr)}. \end{aligned}$$

 □

From this lemma, we have the following corollary.

Corollary 1

Let p be a prime number, and $N,n\geq 1, \nu \geq 0$ be integers with $n\not \equiv 0 {(\operatorname{mod} p-1)}$. If ${\mathrm{ord}}_{p}(N-1)\geq \nu +1+ {\mathrm{ord}}_{p} ( \prod_{k=0}^{n} (1+k)! ) +{\mathrm{ord}} _{p}(n)$, then we have

$$ \frac{B_{N,n}}{n} \equiv \frac{B_{n}}{n }\quad {\bigl(\operatorname{mod} p^{\nu +1}\bigr)}. $$

Furthermore, by using (6), we have the following proposition.

Proposition 2

Let p be a prime number, and $\nu \geq 0$ be an integer. If m and n are positive even integers with $m\geq n$, $m\equiv n\ {(\operatorname{mod} (p-1)p^{\nu })}$ and $m,n\not \equiv 0\ {(\operatorname{mod} (p-1))}$, and ${\mathrm{ord}}_{p}(N-1)\geq \nu +1 +{\mathrm{ord}}_{p} ( \prod_{k=0}^{m} (1+k)! )+ {\mathrm{max}} \{ {\mathrm{ord}} _{p}(m), {\mathrm{ord}}_{p}(n) \}$, then we have

$$ \bigl(1-p^{m-1}\bigr) \frac{B_{N,m}}{m} \equiv \bigl(1-p^{n-1} \bigr) \frac{B_{N,n}}{n}\quad {\bigl(\operatorname{mod} p^{\nu +1}\bigr)}. $$

Note that ${\mathrm{ord}}_{p} ( \prod_{k=0}^{m} (1+k)!) +{\mathrm{max}} \{ {\mathrm{ord}}_{p} (m), {\mathrm{ord}}_{p}(m) \}=0$ if $p>m+1$ in Proposition 2.

Example 1

Consider the case $p=5, m=6, n=2$. For any integer N satisfying

$$ {\mathrm{ord}}_{5}(N-1) \geq 1+{\mathrm{ord}}_{5} \Biggl( \prod_{k=0} ^{6} (1+k)! \Biggr) =4, $$

we have

$$ \frac{B_{N,6}}{6} \equiv \frac{B_{N,2}}{2} \equiv 3\ {(\operatorname{mod} 5)}. $$

Example 2

Consider the case $p=5, m=22, n=2$. For any integer N satisfying

$$ {\mathrm{ord}}_{5}(N-1) \geq 2+{\mathrm{ord}}_{5} \Biggl( \prod_{k=0} ^{22} (1+k)! \Biggr) =48, $$

we have

$$ \bigl(1-5^{21}\bigr)\frac{B_{N,22}}{22} \equiv (1-5) \frac{B_{N,2}}{2} \equiv 8\quad {(\operatorname{mod} 25)}. $$

Determinant expressions

We give a determinant expression of hypergeometric Bernoulli numbers.

Theorem 1

For $N,n\ge 1$, we have

$$B_{N,n}={(-1)}^{n}n!\left|\begin{array}{ccccc}\frac{N!}{(N+1)!}& 1& & & \\ \frac{N!}{(N+2)!}& \frac{N!}{(N+1)!}& & & \\ ⋮& ⋮& \ddots & 1& \\ \frac{N!}{(N+n-1)!}& \frac{N!}{(N+n-2)!}& \cdots & \frac{N!}{(N+1)!}& 1\\ \frac{N!}{(N+n)!}& \frac{N!}{(N+n-1)!}& \cdots & \frac{N!}{(N+2)!}& \frac{N!}{(N+1)!}\end{array}\right|.$$

Remark

When $N=1$, we have a determinant expression of Bernoulli numbers [7, p. 53]:

$$B_n={(-1)}^{n}n!\left|\begin{array}{ccccc}\frac{1}{2!}& 1& & & \\ \frac{1}{3!}& \frac{1}{2!}& & & \\ ⋮& ⋮& \ddots & 1& \\ \frac{1}{n!}& \frac{1}{(n-1)!}& \cdots & \frac{1}{2!}& 1\\ \frac{1}{(n+1)!}& \frac{1}{n!}& \cdots & \frac{1}{3!}& \frac{1}{2!}\end{array}\right|.$$

(7)

Proof of Theorem 1

This theorem is a special case of Theorem 2. □

A relation between $B_{N,n}$ and $B_{N-1,n}$

In this section, we show the following relation between $B_{N,n}$ and $B_{N-1,n}$.

Proposition 3

For $N\geq 2$ and $n\geq 1$, we have

$$\begin{aligned} B_{N,n} ={} & \frac{N}{N+n} \Biggl\{ \sum _{m=0}^{n-1} \sum_{1\leq i_{m} < \cdots < i_{1} < i_{0}=n} B_{N-1,i_{m}} \\ & {}\times \prod_{k=1}^{m} B_{N-1,i_{k-1}-i_{k}+1} \binom{i_{k-1}}{i _{k-1}-i_{k}+1} \frac{N}{N+i_{k}} \Biggr\} . \end{aligned}$$

Example 3

• (i) ${ B_{N,1}=\frac{N}{N+1} B_{N-1,1}}$,

• (ii) ${ B_{N,2}=\frac{N}{N+2} \{ B_{N-1,2}+\frac{N}{N+1} B_{N-1,1} B _{N-1,2} \} }$,

• (iii)
  $$\begin{aligned} B_{N,3} ={} & \frac{N}{N+3} \biggl\{ B_{N-1,3}+ \frac{N}{N+1} B_{N-1,1}B _{N-1,3}+\frac{3N}{N+2} B_{N-1,2}^{2} \\ & {} +\frac{3N^{2}}{(N+1)(N+2)}B_{N-1,1}B_{N-1,2}^{2} \biggr\} . \end{aligned}$$

By using Proposition 3 for $N=2$ and $B_{n}=0$ for odd $n\geq 3$, the numbers $B_{2,n} (0\leq n\leq 4)$ are explicitly given by the classical Bernoulli numbers $B_{n}$ (cf. [15, §9]),

$$\begin{aligned} &B_{2,0}=B_{1} (=1), \\ &B_{2,1}=\frac{2}{3} B_{1} \biggl(=- \frac{1}{3} \biggr), \\ &B_{2,2}=\frac{1}{2} B_{2} +\frac{1}{3} B_{1} B_{2} \biggl(=\frac{1}{2 \times 3^{2}} \biggr), \\ &B_{2,3}=\frac{3}{5} B_{2}^{2}+ \frac{2}{5} B_{1} B_{2}^{2} \biggl(= \frac{1}{2 \times 3^{2}\times 5} \biggr), \\ &B_{2,4} =\frac{1}{3} B_{4}+\frac{2}{9} B_{1} B_{4}+\frac{6}{5} B _{2}^{3}+ \frac{4}{5} B_{1} B_{2}^{3} \biggl(=- \frac{1}{2\times 3^{3} \times 5} \biggr). \end{aligned}$$

Lemma 2

For $N\geq 2$ and $n\geq 1$, we have

$$ B_{N,n}=\frac{N}{N+n} \Biggl\{ B_{N-1,n}+\sum _{m=1}^{n-1} \binom{n}{n-m+1} B_{N,m}B_{N-1,n-m+1} \Biggr\} . $$

Proof

From the derivative of (1), we have

$$\begin{aligned} \sum_{k=0}^{\infty } \frac{B_{N-1,k}}{k!} x^{k} & = \Biggl( \sum_{k=0} ^{\infty } \frac{B_{N,k+1}}{k!} x^{k} \Biggr) \Biggl(1-\sum _{k=0} ^{\infty } \frac{B_{N-1,k}}{k!} x^{k} \Biggr) +\sum_{k=0}^{\infty } \frac{B _{N,k}}{k!} x^{k}. \end{aligned}$$

By $B_{N-1,0}=1$, we have

$$\begin{aligned} \sum_{k=0}^{\infty } \frac{B_{N-1,k}}{k!} x^{k} & =-\sum_{k=0}^{ \infty } \sum _{\ell =0}^{\infty } B_{N,k+1}B_{N-1,\ell +1} \frac{x ^{k+\ell +1}}{k!(\ell +1)!} +\sum_{k=0}^{\infty } \frac{B_{N,k}}{k!} x ^{k} \\ & =-\sum_{n=1}^{\infty } \sum _{\ell =0}^{n-1} B_{N,n-\ell }B_{N-1, \ell +1} \binom{n}{\ell +1} \frac{x^{n}}{n!} +\sum_{k=0}^{\infty } \frac{B _{N,k}}{k!} x^{k} \\ & =\sum_{n=1}^{\infty } \Biggl\{ B_{N,n}- \sum_{\ell =0}^{n-1} \binom{n}{ \ell +1}B_{N,n-\ell }B_{N-1,\ell +1} \Biggr\} \frac{x^{n}}{n!} +B _{N,0}. \end{aligned}$$

Therefore, we have

$$ B_{N-1,n}=B_{N,n}-\sum_{\ell =0}^{n-1} \binom{n}{\ell +1} B_{N,n- \ell }B_{N-1,\ell +1}, $$

for $n\geq 1$. By $B_{N-1,1}=-\frac{1}{N}$, the assertion follows. □

Proof of Proposition 3

We give the proof by induction for n. In the case $n=1$, the assertion means $B_{N,1}=\frac{N}{N+1} B_{N-1,1}$, and this equality follows from $B_{N,1}=-\frac{1}{N+1}$ and $B_{N-1,1}=-\frac{1}{N}$. Assume that the assertion holds up to $n-1$. By Lemma 2, we have

$$\begin{aligned} B_{N,n} = {}& \frac{N}{N+n} \Biggl\{ B_{N-1,n}+\sum _{i_{1}=1}^{n-1} \binom{n}{n-i _{1}+1} B_{N-1,n-i_{1}+1} \frac{N}{N+i_{1}} \\ &{} \times \Biggl( \sum_{m=0}^{i_{1}-1} \sum_{1\leq i_{m+1} < \cdots < i_{2}< i_{1}} B_{N-1,i_{m+1}}\prod _{k=2} ^{m+1} B_{N-1,i_{k-1}-i_{k}+1} \binom{i_{k-1}}{i_{k-1}-i_{k}+1} \frac{N}{N+i _{k}} \Biggr) \Biggr\} \\ = {}& \frac{N}{N+n} \Biggl\{ B_{N-1,n}+\sum _{i_{1}=1}^{n-1} \sum_{m=0} ^{i_{1}-1} \sum_{1\leq i_{m+1}< \cdots < i_{2}< i_{1} } B_{N-1,i_{m+1} } \\ &{} \times \prod_{k=1}^{m+1} B_{N-1,i_{k-1}-i_{k}+1} \binom{i _{k-1}}{i_{k-1}-i_{k}+1} \frac{N}{N+i_{k}} \Biggr\} \\ ={} & \frac{N}{N+n} \Biggl\{ B_{N-1,n} +\sum _{i_{1}=1}^{n-1}\sum_{ \ell =1}^{i_{1}} \sum_{1\leq i_{\ell }< \cdots < i_{2} < i_{1}} B_{N-1,i _{\ell } } \\ &{} \times \prod_{k=1}^{\ell } B_{N-1,i_{k-1}-i_{k}+1} \binom{i _{k-1}}{i_{k-1}-i_{k}+1} \frac{N}{N+i_{k}} ) \Biggr\} \\ = {}& \frac{N}{N+n} \Biggl\{ B_{N-1,n} + \sum _{m=1}^{n-1} \sum_{1\leq i_{m} < \cdots < i_{1} \leq n-1} B_{N-1,i_{m}} \\ & {} \times \prod_{k=1}^{m} B_{N-1,i_{k-1}-i_{k}+1} \binom{i _{k-1}}{i_{k-1}-i_{k}+1} \frac{N}{N+i_{k}} \Biggr\} \\ = {}& \frac{N}{N+n} \Biggl\{ \sum_{m=0}^{n-1} \sum_{1\leq i_{m} < \cdots < i_{1} < i_{0}=n} B_{N-1,i_{m}} \\ &{} \times \prod_{k=1}^{m} B_{N-1,i_{k-1}-i_{k}+1} \binom{i _{k-1}}{i_{k-1}-i_{k}+1} \frac{N}{N+i_{k}} \Biggr\} . \end{aligned}$$

 □

Multiple hypergeometric Bernoulli numbers

In this section, we define a more general hypergeometric Bernoulli number and give the properties.

For positive integers N and r, define the higher order hypergeometric Bernoulli numbers $B_{N,n}^{(r)}$ [18, 26] by the generating function

$$ \frac{1}{{}_{1}F_{1}(1;N+1;x)^{r}} = \biggl(\frac{x^{N}/N!}{e^{x}- \sum_{n=0}^{N-1}x^{n}/n!} \biggr)^{r}=\sum _{n=0}^{\infty }B_{N,n}^{(r)} \frac{x ^{n}}{n!}. $$

(8)

The higher order hypergeometric Bernoulli polynomials $B_{N,n}^{(r)}(x)$ are studied in [17], we have $B_{N,n}^{(r)}=B_{N,n}^{(r)}(0)$.

From the definition (8), we have

$$\begin{aligned} \biggl(\frac{x^{N}}{N!} \biggr)^{r} &= \Biggl(\sum _{i=0}^{\infty }\frac{x ^{i+N}}{(i+N)!} \Biggr)^{r} \Biggl(\sum_{m=0}^{\infty }B_{N,m}^{(r)} \frac{x ^{m}}{m!} \Biggr) \\ &=x^{r N} \Biggl(\sum_{l=0}^{\infty } \sum_{{i_{1}+\cdots +i_{r}=l\atop i_{1},\dots,i_{r}\ge 0}}\frac{l!}{(N+i _{1})!\cdots (N+i_{r})!}\frac{x^{l}}{l!} \Biggr) \Biggl(\sum_{m=0}^{ \infty }B_{N,m}^{(r)} \frac{x^{m}}{m!} \Biggr) \\ &=x^{r N}\sum_{n=0}^{\infty }\sum _{m=0}^{n} \sum_{{i_{1}+\cdots +i_{r}=n-m\atop i_{1},\dots,i_{r}\ge 0}} \binom{n}{m}\frac{(n-m)!}{(N+i_{1})!\cdots (N+i_{r})!}B_{N,m}^{(r)} \frac{x ^{n}}{n!}. \end{aligned}$$

Hence, as a generalization of Proposition 1 (3), for $n\ge 1$, we have the following.

Proposition 4

We have

$$ \sum_{m=0}^{n} \sum _{{i_{1}+\cdots +i_{r}=n-m\atop i_{1},\dots,i_{r}\ge 0}}\frac{B _{N,m}^{(r)}}{m!(N+i_{1})!\cdots (N+i_{r})!}=0. $$

By using Proposition 4 or

$$ B_{N,n}^{(r)}=-n!(N!)^{r}\sum _{m=0}^{n-1} \sum_{{i_{1}+\cdots +i_{r}=n-m\atop i_{1},\dots,i_{r}\ge 0}} \frac{B _{N,m}^{(r)}}{m!(N+i_{1})!\cdots (N+i_{r})!} $$

(9)

with $B_{N,0}^{(r)}=1$ ($N\ge 1$), some values of $B_{N,n}^{(r)}$ ($0 \le n\le 4$) are explicitly given by the following:

$$\begin{aligned} &B_{N,0}^{(r)}=1, \\ &B_{N,1}^{(r)}=-\frac{r}{N+1}, \\ &B_{N,2}^{(r)}=\frac{2 r}{(N+1)^{2}(N+2)} \biggl(-(N+1)+ \frac{r+1}{2}(N+2) \biggr) , \\ &B_{N,3}^{(r)}=\frac{3!r}{(N+1)^{3}(N+2)(N+3)} \biggl(-(N+1)^{2}+(r+1) (N+1) (N+3) \\ &\phantom{B_{N,3}^{(r)}=}{}-\frac{(r+1)(r+2)}{6}(N+2) (N+3) \biggr), \\ &B_{N,4}^{(r)}=\frac{4!r}{(N+1)^{4}(N+2)^{2}(N+3)(N+4)} \biggl(-(N+1)^{3}(N+2) \\ & \phantom{B_{N,4}^{(r)}=}{}+(r+1) (N+1)^{2}(N+2) (N+4)+\frac{r+1}{2}(N+1)^{2}(N+3) (N+4) \\ &\phantom{B_{N,4}^{(r)}=}{} -\frac{(r+1)(r+2)}{2}(N+1) (N+2) (N+3) (N+4) \\ &\phantom{B_{N,4}^{(r)}=}{} +\frac{(r+1)(r+2)(r+3)}{4!}(N+2)^{2}(N+3) (N+4) \biggr) . \end{aligned}$$

As a generalization of Proposition 1 (4), we have an explicit expression of $B_{N,n}^{(r)}$.

Proposition 5

For $N,n\ge 1$, we have

$$ B_{N,n}^{(r)}=n!\sum_{k=1}^{n}(-1)^{k} \sum_{{e_{1}+\cdots +e_{k}=n\atop e_{1},\dots,e_{k}\ge 1}}M_{r}(e _{1})\cdots M_{r}(e_{k}), $$

where

$$ M_{r}(e)= \sum_{{i_{1}+\cdots +i_{r}=e\atop i_{1},\dots,i_{r}\ge 0}}\frac{(N!)^{r}}{(N+i _{1})!\cdots (N+i_{r})!}. $$

(10)

We shall introduce the Hasse–Teichmüller derivative in order to prove Proposition 5 easily. Let $\mathbb{F}$ be a field of any characteristic, $\mathbb{F}[[z]]$ the ring of formal power series in one variable z, and $\mathbb{F}((z))$ the field of Laurent series in z. Let n be a nonnegative integer. We define the Hasse–Teichmüller derivative $H^{(n)}$ of order n by

$$ H^{(n)} \Biggl(\sum_{m=R}^{\infty } c_{m} z^{m} \Biggr) =\sum_{m=R} ^{\infty } c_{m} \binom{m}{n}z^{m-n} $$

for $\sum_{m=R}^{\infty } c_{m} z^{m}\in \mathbb{F}((z))$, where R is an integer and $c_{m}\in \mathbb{F}$ for any $m\geq R$. Note that $\binom{m}{n}=0$ if $m< n$.

The Hasse–Teichmüller derivatives satisfy the product rule [27], the quotient rule [8] and the chain rule [12]. One of the product rules can be described as follows.

Lemma 3

For $f_{i}\in \mathbb{F}[[z]]$ $(i=1,\dots,k)$ with $k\ge 2$ and for $n\ge 1$, we have

$$ H^{(n)}(f_{1}\cdots f_{k})= \sum _{{i_{1}+\cdots +i_{k}=n\atop i_{1},\dots,i_{k}\ge 0}}H^{(i_{1})}(f _{1})\cdots H^{(i_{k})}(f_{k}). $$

The quotient rules can be described as follows.

Lemma 4

For $f\in \mathbb{F}[[z]]\backslash \{0\}$ and $n\ge 1$, we have

$$\begin{aligned} H^{(n)} \biggl(\frac{1}{f} \biggr) &=\sum _{k=1}^{n}\frac{(-1)^{k}}{f ^{k+1}}\sum _{{i_{1}+\cdots +i_{k}=n\atop i_{1},\dots,i_{k}\ge 1}}H ^{(i_{1})}(f)\cdots H^{(i_{k})}(f) \end{aligned}$$

(11)

$$\begin{aligned} &=\sum_{k=1}^{n}\binom{n+1}{k+1} \frac{(-1)^{k}}{f^{k+1}} \sum_{{i_{1}+\cdots +i_{k}=n\atop i_{1},\dots,i_{k}\ge 0}}H^{(i_{1})}(f) \cdots H^{(i_{k})}(f). \end{aligned}$$

(12)

Proof of Proposition 5

Put $h(x)= (f(x) )^{r}$, where

$$ f(x)=\frac{\sum_{i=N}^{\infty }\frac{x^{i}}{i!}}{\frac{x^{N}}{N!}}= \sum_{j=0}^{\infty } \frac{N!}{(N+j)!}x^{j}. $$

Since

$$\begin{aligned} H^{(i)}(f)|_{x=0} &=\sum _{j=i}^{\infty } \frac{N!}{(N+j)!}\binom{j}{i}x^{j-i}\Big|_{x=0} \\ &= \frac{N!}{(N+i)!} \end{aligned}$$

by the product rule of the Hasse–Teichmüller derivative in Lemma 3, we get

$$\begin{aligned} H^{(e)}(h)|_{x=0} &= \sum _{{i_{1}+\cdots +i_{r}=e\atop i_{1},\dots,i_{r}\ge 0}} H ^{(i_{1})}(f)|_{x=0}\cdots H^{(i_{r})}(f)|_{x=0} \\ &=\sum_{{i_{1}+\cdots +i_{r}=e\atop i_{1},\dots,i_{r}\ge 0}}\frac{N!}{(N+i _{1})!}\cdots \frac{N!}{(N+i_{r})!}=M_{r}(e). \end{aligned}$$

Hence, by the quotient rule of the Hasse–Teichmüller derivative in Lemma 4 (11), we have

$$\begin{aligned} \frac{B_{N,n}^{(r)}}{n!} &=\sum_{k=1}^{n} \frac{(-1)^{k}}{h^{k+1}}\Big| _{x=0}\sum_{{e_{1}+\cdots +e_{k}=n\atop e_{1},\dots,e_{k}\ge 1}} H^{(e_{1})}(h)|_{x=0}\cdots H^{(e_{k})}(h)| _{x=0} \\ &=\sum_{k=1}^{n}(-1)^{k} \sum _{{e_{1}+\cdots +e_{k}=n\atop e_{1},\dots,e_{k}\ge 1}}M_{r}(e _{1})\cdots M_{r}(e_{k}). \end{aligned}$$

 □

Now, we can also show a determinant expression of $B_{N,n}^{(r)}$.

Theorem 2

For $N,n\ge 1$, we have

$$B_{N,n}^{(r)}={(-1)}^{n}n!\left|\begin{array}{ccccc}{M}_r(1)& 1& & & \\ M_r(2)& M_r(1)& & & \\ ⋮& ⋮& \ddots & 1& \\ M_r(n-1)& M_r(n-2)& \cdots & M_r(1)& 1\\ M_r(n)& M_r(n-1)& \cdots & M_r(2)& M_r(1)\end{array}\right|,$$

where $M_{r}(e)$ are given in (10).

Remark

When $r=1$ in Theorem 2, we have the result in Theorem 1.

Proof

For simplicity, put $A_{N,n}^{(r)}=(-1)^{n} B_{N,n}^{(r)}/n!$. Then we shall prove that for any $n\ge 1$,

$$A_{N,n}^{(r)}=\left|\begin{array}{ccccc}{M}_r(1)& 1& & & \\ M_r(2)& M_r(1)& & & \\ ⋮& ⋮& \ddots & 1& \\ M_r(n-1)& M_r(n-2)& \cdots & M_r(1)& 1\\ M_r(n)& M_r(n-1)& \cdots & M_r(2)& M_r(1)\end{array}\right|.$$

(13)

When $n=1$, (13) is valid because

$$ M_{r}(1)=\frac{r(N!)^{r}}{(N!)^{r-1}(N+1)!}=\frac{r}{N+1}=A_{N,1}^{(r)} . $$

Assume that (13) is valid up to $n-1$. Notice that by (9), we have

$$ A_{N,n}^{(r)}=\sum_{l=1}^{n}(-1)^{l-1}A_{N,n-l}^{(r)}M_{r}(l). $$

Thus, by expanding the first row of the right-hand side of (13), it is equal to

$$\begin{array}{rl}& M_r(1)A_{N,n-1}^{(r)}-\left|\begin{array}{ccccc}{M}_r(2)& 1& & & \\ M_r(3)& M_r(1)& & & \\ ⋮& ⋮& \ddots & 1& \\ M_r(n-1)& M_r(n-3)& \cdots & M_r(1)& 1\\ M_r(n)& M_r(n-2)& \cdots & M_r(2)& M_r(1)\end{array}\right|\\ & =M_r(1)A_{N,n-1}^{(r)}-M_r(2)A_{N,n-2}^{(r)}\\ & +\left|\begin{array}{ccccc}{M}_r(3)& 1& & & \\ M_r(4)& M_r(1)& & & \\ ⋮& ⋮& \ddots & 1& \\ M_r(n-1)& M_r(n-4)& \cdots & M_r(1)& 1\\ M_r(n)& M_r(n-3)& \cdots & M_r(2)& M_r(1)\end{array}\right|\\ & =M_r(1)A_{N,n-1}^{(r)}-M_r(2)A_{N,n-2}^{(r)}+\cdots +{(-1)}^{n-2}\left|\begin{array}{cc}{M}_r(n-1)& 1\\ M_r(n)& M_r(1)\end{array}\right|\\ & =\sum _{l=1}^n{(-1)}^{l-1}{M}_r(l)A_{N,n-l}^{(r)}=A_{N,n}^{(r)}.\end{array}$$

Note that $A_{N,1}^{(r)}=M_{r}(1)$ and $A_{N,0}^{(r)}=1$. □

A relation between $B_{N,n}^{(r)}$ and $B_{N,n}$

In this section, we show the following relation between $B_{N,n}^{(r)}$ and $B_{N,n}$.

Lemma 5

For $r,N\geq 1$ and $n\geq 0$, we have

$$ B_{N,n}^{(r)}= \sum_{{n_{1},\ldots,n_{r} \geq 0 \atop n_{1}+\cdots +n_{r}=n}} \frac{n!}{n _{1}! \cdots n_{r}!} B_{N,n_{1}} \cdots B_{N,n_{r}}. $$

Proof

From the definition (1) and (8), we get the assertion. □

We give some examples for Lemma 5. Note that $B_{N,n}=B_{N,n}^{(1)}$ by the definition.

Example 4

• (i) $B_{N,0}^{(r)}=B_{N,0}^{r}\ (r\geq 1)$,

• (ii) $B_{N,1}^{(r)}=rB_{N,1} B_{N,0}^{r-1}\ (r \geq 1)$,

• (iii)
  $$\begin{aligned} B_{N,2}^{(r)}& = \sum_{{n_{1},\ldots,n_{r} \geq 0 \atop n_{1}+\cdots +n_{r}=2}} \frac{2}{n _{1}! \cdots n_{r}!} B_{N,n_{1}} \cdots B_{N,n_{r}} \\ & = \sum_{ {n_{1},\ldots,n_{r} \in \{ 0,2 \} \atop n_{1}+\cdots +n_{r}=2}} \frac{2}{n _{1}! \cdots n_{r}!} B_{N,n_{1}} \cdots B_{N,n_{r}} + \sum_{{n_{1},\ldots,n_{r} \in \{ 0,1 \} \atop n_{1}+\cdots +n_{r}=2}} \frac{2}{n_{1}! \cdots n_{r}!} B_{N,n_{1}} \cdots B_{N,n_{r}} \\ &= r B_{N,2}B_{N,0}^{N-1}+r(r-1)B_{N,1}^{2}B_{N,0}^{r-2}\quad (r \geq 2). \end{aligned}$$

Applications by the Trudi’s formula and inversion expressions

We can obtain different explicit expressions for the numbers $B_{N,n}^{(r)}$, $B_{N,n}$ and $B_{n}$ by using the Trudi’s formula. We also show some inversion formulas. The following relation is known as Trudi’s formula [24, Vol. 3, p. 214], [28] and the case $a_{0}=1$ of this formula is known as Brioschi’s formula [2], [24, Vol. 3, pp. 208–209].

Lemma 6

For a positive integer m, we have

$$\begin{array}{rl}& \left|\begin{array}{ccccc}{a}_1& a_2& \cdots & \cdots & a_m\\ a_0& a_1& \ddots & & ⋮\\ & \ddots & \ddots & \ddots & ⋮\\ & & \ddots & a_1& a_2\\ & & & a_0& a_1\end{array}\right|\\ & =\sum _{t_1+2t_2+\cdots +m{t}_m=m}\left(\genfrac{}{}{0ex}{}{t_1+\cdots +t_m}{t_1,\dots ,t_m}\right){(-a_0)}^{m-t_1-\cdots -t_m}{a}_1^{t_1}{a}_2^{t_2}\cdots a_m^{t_m},\end{array}$$

where $\binom{t_{1}+\cdots + t_{m}}{t_{1}, \dots,t_{m}}=\frac{(t_{1}+ \cdots + t_{m})!}{t_{1} !\cdots t_{m} !}$ are the multinomial coefficients.

In addition, there exists the following inversion formula (see, e.g., [21]), which is based upon the relation

$$ \sum_{k=0}^{n}(-1)^{n-k}\alpha _{k} R(n-k)=0 \quad (n\ge 1). $$

Lemma 7

If $\{\alpha _{n}\}_{n\geq 0}$ is a sequence defined by $\alpha _{0}=1$ and

$$ \alpha _{n}= \begin{vmatrix} R(1) & 1 & & \\ R(2) & \ddots & \ddots & \\ \vdots & \ddots & \ddots & 1 \\ R(n) & \cdots & R(2) & R(1) \end{vmatrix} , \quad\textit{then } R(n)= \begin{vmatrix} \alpha _{1} & 1 & & \\ \alpha _{2} & \ddots & \ddots & \\ \vdots & \ddots & \ddots & 1 \\ \alpha _{n} & \cdots & \alpha _{2} & \alpha _{1} \end{vmatrix} . $$

Moreover, if

$$ A= \begin{pmatrix} 1 & & & \\ \alpha _{1} & 1 & & \\ \vdots & \ddots & \ddots & \\ \alpha _{n}& \cdots & \alpha _{1} & 1 \end{pmatrix} , \quad\textit{then } A^{-1}= \begin{pmatrix} 1 & & & \\ R(1) & 1 & & \\ \vdots & \ddots & \ddots & \\ R(n) & \cdots & R(1) & 1 \end{pmatrix} . $$

From Trudi’s formula, it is possible to give the combinatorial expression

$$ \alpha _{n}=\sum_{t_{1}+2t_{2}+\cdots +n t_{n}=n} \binom{t_{1}+\cdots +t _{n}}{t_{1}, \dots, t_{n}}(-1)^{n-t_{1}-\cdots - t_{n}}R(1)^{t_{1}}R(2)^{t _{2}}\cdots R(n)^{t_{n}}. $$

By applying these lemmas to Theorem 2, we obtain an explicit expression for the generalized hypergeometric Bernoulli numbers $B_{N,n}^{(r)}$.

Theorem 3

For $n\geq 1$,

$$\begin{aligned} B_{N,n}^{(r)} =n!\sum_{t_{1} + 2t_{2} + \cdots + nt_{n}=n}\binom{t_{1}+\cdots + t _{n}}{t_{1}, \dots,t_{n}}(-1)^{t_{1}+\cdots +t_{n}}M_{r}(1)^{t_{1}}M _{r}(2)^{t_{2}}\cdots M_{r}(n)^{t_{n}}, \end{aligned}$$

where $M_{r}(e)$ are given in (10). Moreover,

$$ M_{r}(n)= \begin{vmatrix} -\frac{B_{N,1}^{(r)}}{1!} & 1 & & \\ \frac{B_{N,2}^{(r)}}{2!} & \ddots & \ddots & \\ \vdots & \ddots & \ddots & 1 \\ \frac{(-1)^{n} B_{N,n}^{(r)}}{n!} & \cdots & \frac{B_{N,2}^{(r)}}{2!} & -\frac{B_{N,1}^{(r)}}{1!} \end{vmatrix} $$

and

$$\begin{aligned} & \begin{pmatrix} 1 & & & & \\ -\frac{B_{N,1}^{(r)}}{1!} & 1 & & & \\ \frac{B_{N,2}^{(r)}}{2!} & -\frac{B_{N,1}^{(r)}}{1!} & 1 & & \\ \vdots & & \ddots & \ddots & \\ \frac{(-1)^{n} B_{N,n}^{(r)}}{n!} & \cdots & \frac{B_{N,2}^{(r)}}{2!} & -\frac{B_{N,1}^{(r)}}{1!} &1 \end{pmatrix} ^{-1} \\ &\quad = \begin{pmatrix} 1 & & & & \\ M_{r}(1) & 1 & & & \\ M_{r}(2) & M_{r}(1) & 1 & & \\ \vdots & & \ddots & \ddots & \\ M_{r}(n) & \cdots & M_{r}(2) & M_{r}(1) &1 \end{pmatrix} . \end{aligned}$$

When $r=1$ in Theorem 3, we have an explicit expression for the numbers $B_{N,n}$.

Corollary 2

For $n\geq 1$,

$$\begin{aligned} B_{N,n} ={}&n!\sum_{t_{1} + 2t_{2} + \cdots + nt_{n}=n}\binom{t_{1}+ \cdots + t_{n}}{t_{1}, \dots,t_{n}}(-1)^{t_{1}+\cdots +t_{n}} \\ &{}\times \biggl(\frac{N!}{(N+1)!} \biggr)^{t_{1}} \biggl( \frac{N!}{(N+2)!} \biggr) ^{t_{2}}\cdots \biggl(\frac{N!}{(N+n)!} \biggr)^{t_{n}} \end{aligned}$$

and

$$ \frac{N!}{(N+n)!}= \begin{vmatrix} -\frac{B_{N,1}}{1!} & 1 & & \\ \frac{B_{N,2}}{2!} & \ddots & \ddots & \\ \vdots & \ddots & \ddots & 1 \\ \frac{(-1)^{n} B_{N,n}}{n!} & \cdots & \frac{B_{N,2}}{2!} & -\frac{B _{N,1}}{1!} \end{vmatrix} . $$

When $r=N=1$ in Theorem 3, we have a different expression of the classical Bernoulli numbers.

Corollary 3

We have for $n\ge 1$,

$$\begin{aligned} B_{n} ={}&n!\sum_{t_{1} + 2t_{2} + \cdots + nt_{n}=n}\binom{t_{1}+\cdots + t_{n}}{t_{1}, \dots,t_{n}}(-1)^{t_{1}+\cdots +t_{n}} \\ &{}\times \biggl(\frac{1}{2!} \biggr)^{t_{1}} \biggl( \frac{1}{3!} \biggr) ^{t_{2}}\cdots \biggl(\frac{1}{(n+1)!} \biggr)^{t_{n}} \end{aligned}$$

and

$$ \frac{1}{(n+1)!}= \begin{vmatrix} -\frac{B_{1}}{1!} & 1 & & \\ \frac{B_{2}}{2!} & \ddots & \ddots & \\ \vdots & \ddots & \ddots & 1 \\ \frac{(-1)^{n} B_{n}}{n!} & \cdots & \frac{B_{2}}{2!} & - \frac{B_{1}}{1!} \end{vmatrix} . $$

Continued fractions of hypergeometric Bernoulli numbers

In the final section, we show several identities for hypergeometric Bernoulli numbers which the convergents of the continued fraction expansion of the generating function of hypergeometric Bernoulli numbers entail.

In [1, 19] by studying the convergents of the continued fraction of

$$ \frac{x/2}{\tanh x/2}=\sum_{n=0}^{\infty }B_{2 n} \frac{x^{2 n}}{(2 n)!}, $$

some identities of Bernoulli numbers are obtained. In this section, the nth convergent of the generating function of hypergeometric Bernoulli numbers is explicitly given. As an application, we give some identities of hypergeometric Bernoulli numbers in terms of binomial coefficients.

The generating function on the left-hand side of (1) can be expanded as a continued fraction

$$ \frac{1}{{}_{1} F_{1}(1;N+1;x)} =1-\cfrac{x}{N+1+\cfrac{x}{N+2-\cfrac{(N+1)x}{N+3+\cfrac{2 x}{N+4-\cfrac{(N+2)x}{N+5+ \ddots }}}}} $$

(14)

(cf. [29, (91.2)]). Its nth convergent $P_{n}(x)/Q _{n}(x)$ ($n\ge 0$) is given by the recurrence relation

$$\begin{aligned} &P_{n}(x)=a_{n}(x)P_{n-1}(x)+b_{n}(x)P_{n-2}(x)\quad(n \ge 2), \end{aligned}$$

(15)

$$\begin{aligned} &Q_{n}(x)=a_{n}(x)Q_{n-1}(x)+b_{n}(x)Q_{n-2}(x)\quad(n \ge 2), \end{aligned}$$

(16)

with initial values

$$\begin{aligned} &P_{0}(x)=1, \qquad P_{1}(x)=(N+1)-x; \\ &Q_{0}(x)=1, \qquad Q_{1}(x)=N+1, \end{aligned}$$

where, for $n\ge 1$, $a_{n}(x)=N+n$, $b_{2n}(x)=n x$ and $b_{2 n+1}(x)=-(N+n)x$.

We have explicit expressions of both the numerator and the denominator of the nth convergent of (14).

Theorem 4

For $n\ge 1$, we have

$$\begin{aligned} &P_{2 n-1}(x)=\sum_{j=0}^{n}(-1)^{j} \binom{n}{j}\prod_{l=1}^{2 n-j-1}(N+l) \cdot x^{j}, \\ &P_{2 n}(x)=\sum_{j=0}^{n}(-1)^{j} \binom{n}{j}\prod_{l=1}^{2 n-j}(N+l) \cdot x^{j}, \end{aligned}$$

and

$$\begin{aligned} &Q_{2 n-1}(x)=\sum_{j=0}^{n-1}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j-1)_{k} \binom{n-k-1}{j-k}\prod_{l=k+1}^{2 n-j-1}(N+l) \cdot x^{j}, \\ &Q_{2 n}(x)=\sum_{j=0}^{n}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j)_{k} \binom{n-k-1}{j-k}\prod_{l=k+1}^{2 n-j}(N+l) \cdot x^{j}. \end{aligned}$$

Remark

Here we use the convenient values

$$ \binom{n}{k}=0\quad (0\le n< k), \qquad\binom{-1}{0}=1, $$

and recognize the empty product as 1. Otherwise, we should write $Q_{2 n}(x)$ as

$$ Q_{2 n}(x)=\sum_{j=0}^{n-1}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j)_{k} \binom{n-k-1}{j-k}\prod_{l=k+1}^{2 n-j}(N+l) \cdot x^{j}+n! x^{n}. $$

If we use the unsigned Stirling numbers of the first kind, $[{n\atop k} ]$, of which the generating function is given by

$$ \sum_{n=k}^{\infty }(-1)^{n-k} \begin{bmatrix}n\cr k \end{bmatrix}\frac{z^{n}}{n!}=\frac{ (\log (1+z) )^{k}}{k!} $$

[9, (7.50)], we can express the products as

$$ \prod_{l=1}^{2 n-j-1}(N+l)=\sum _{i=1}^{2 n-j} \begin{bmatrix} 2 n-j\cr i\end{bmatrix} N ^{i-1} $$

or

$$ \prod_{l=k+1}^{2 n-j-1}(N+l)=\sum _{i=1}^{2 n-j-k} \begin{bmatrix} 2 n-j-k\cr i\end{bmatrix}(N+k)^{i-1} . $$

Proof of Theorem 4

The proof is done by induction on n. It is easy to see that for $n=0$, we have $P_{0}(x)=Q_{0}(x)=1$, and for $n=1$, we have $P_{1}(x)=(N+1)-x$ and $Q_{1}(x)=N+1$. Assume that the results hold up to $n-1(\ge 2)$. Then by using the recurrence relation in (16)

$$\begin{aligned} &(N+2 n)P_{2 n-1}(x)+n P_{2 n-2}(x)\cdot x \\ &\quad =(N+2 n)\sum_{j=0}^{n}(-1)^{j} \binom{n}{j}\prod_{l=1}^{2 n-j-1}(N+l) \cdot x^{j} \\ &\qquad{} +n\sum_{j=0}^{n-1}(-1)^{j} \binom{n-1}{j}\prod_{l=1}^{2 n-j-2}(N+l) \cdot x^{j+1} \\ &\quad=(N+2 n)\prod_{l=1}^{2 n-1}(N+l) \\ &\qquad{} +(N+2 n)\sum_{j=1}^{n}(-1)^{j} \binom{n}{j}\prod_{l=1}^{2 n-j-1}(N+l) \cdot x^{j} \\ &\qquad{} -n\sum_{j=1}^{n}(-1)^{j} \binom{n-1}{j-1}\prod_{l=1}^{2 n-j-1}(N+l) \cdot x^{j}. \end{aligned}$$

Since

$$ (N+2 n)\binom{n}{j}-n\binom{n-1}{j-1}=(N+2 n-j)\binom{n}{j}, $$

we get

$$\begin{aligned} &(N+2 n)P_{2 n-1}(x)+n P_{2 n-2}(x)\cdot x \\ &\quad =\sum_{j=0}^{n}(-1)^{j} \binom{n}{j}\prod_{l=1}^{2 n-j}(N+l)\cdot x ^{j} \\ &\quad =P_{2 n}. \end{aligned}$$

Next,

$$\begin{aligned} &(N+2 n+1)P_{2 n}(x)-(N+n)P_{2 n-1}(x)\cdot x \\ &\quad =(N+2 n+1)\sum_{j=0}^{n}(-1)^{j} \binom{n}{j}\prod_{l=1}^{2 n-j}(N+l) \cdot x^{j} \\ &\qquad{} -(N+n)\sum_{j=0}^{n}(-1)^{j} \binom{n}{j}\prod_{l=1}^{2 n-j-1}(N+l) \cdot x^{j+1} \\ &\quad=(N+2 n+1)\prod_{l=1}^{2 n}(N+l) \\ &\qquad{} +(N+2 n+1)\sum_{j=1}^{n}(-1)^{j} \binom{n}{j}\prod_{l=1}^{2 n-j}(N+l) \cdot x^{j} \\ &\qquad{} +(N+n)\sum_{j=1}^{n}(-1)^{j} \binom{n}{j-1}\prod_{l=1}^{2 n-j}(N+l) \cdot x^{j} \\ &\qquad{} -(N+n) (-1)^{n}\prod_{l=1}^{n-1}(N+l) \cdot x^{n+1}. \end{aligned}$$

Since

$$ (N+2 n+1)\binom{n}{j}+(N+n)\binom{n}{j-1}=(N+2 n-j+1) \binom{n+1}{j}, $$

we get

$$\begin{aligned} &(N+2 n+1)P_{2 n}(x)-(N+n)P_{2 n-1}(x)\cdot x \\ &\quad =\sum_{j=0}^{n+1}(-1)^{j} \binom{n+1}{j}\prod_{l=1}^{2 n-j+1}(N+l) \cdot x^{j} \\ &\quad =P_{2 n+1}. \end{aligned}$$

Concerning $Q_{n}(x)$,

$$\begin{aligned} &(N+2 n)Q_{2 n-1}(x)+n Q_{2 n-2}(x)\cdot x \\ &\quad =(N+2 n)\sum_{j=0}^{n-1}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j-1)_{k} \binom{n-k-1}{j-k}\prod_{l=k+1}^{2 n-j-1}(N+l) \cdot x^{j} \\ &\qquad{} +n\sum_{j=0}^{n-1}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j-2)_{k} \binom{n-k-2}{j-k}\prod_{l=k+1}^{2 n-j-2}(N+l) \cdot x^{j+1} \\ &\quad=\prod_{l=1}^{2 n}(N+l)-n\sum _{k=0}^{n-1}(-1)^{n-k}(n)_{k} \binom{n-k-2}{n-k-1}\prod_{l=k+1}^{n-1}(N+l)\cdot x^{n} \\ & \qquad{}+\sum_{j=1}^{n-1}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j-1)_{k} \\ &\qquad{} \times \binom{n-k-1}{j-k}(N+2 n)\prod_{l=k+1}^{2 n-j-1}(N+l) \cdot x ^{j} \\ & \qquad {}-n\sum_{j=1}^{n-1}\sum _{k=0}^{j-1}(-1)^{j-k}n(2 n-j-1)_{k} \binom{n-k-2}{j-k-1}\prod_{l=k+1}^{2 n-j-1}(N+l) \cdot x^{j}. \end{aligned}$$

Since $N+2 n=(N+2 n-j)+j$,

$$\begin{aligned} &\prod_{l=k+1}^{2 n-j-1}(N+l)=\prod _{l=k+2}^{2 n-j}(N+l)-(2 n-j-k-1) \prod _{l=k+2}^{2 n-j-1}(N+l), \\ &(j-k)\binom{n-k-1}{j-k}-n\binom{n-k-2}{j-k-1}=-(k+1) \binom{n-k-2}{j-k-1} \end{aligned}$$

and $(2 n-j-1)_{k}+k(2 n-j-1)_{k-1}=(2 n-j)_{k}$, we obtain

$$\begin{aligned} &(N+2 n)Q_{2 n-1}(x)+n Q_{2 n-2}(x)\cdot x \\ &\quad=\prod_{l=1}^{2 n}(N+l)+n! x^{n} \\ &\qquad{} +\sum_{j=1}^{n-1}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j-1)_{k} \binom{n-k-1}{j-k}\prod_{l=k+1}^{2 n-j}(N+l) \cdot x^{j} \\ &\qquad{} +\sum_{j=1}^{n-1}\sum _{k=0}^{j}(-1)^{j-k}j(2 n-j-1)_{k} \\ &\qquad{} \times \binom{n-k-1}{j-k}(N+2 n)\prod_{l=k+1}^{2 n-j-1}(N+l) \cdot x ^{j} \\ &\qquad{} -\sum_{j=1}^{n-1}\sum _{k=0}^{j-1}(-1)^{j-k}n(2 n-j-1)_{k} \\ &\qquad{} \times \binom{n-k-2}{j-k-1}(N+2 n)\prod_{l=k+1}^{2 n-j-1}(N+l) \cdot x ^{j} \\ &\quad=\prod_{l=1}^{2 n}(N+l)+n! x^{n} \\ & \qquad{}+\sum_{j=1}^{n-1}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j)_{k} \binom{n-k-1}{j-k}\prod_{l=k+1}^{2 n-j}(N+l)\cdot x^{j} \\ &\quad =Q_{2 n}. \end{aligned}$$

Similarly,

$$\begin{aligned} &(N+2 n+1)Q_{2 n}(x)-(N+n)x Q_{2 n-1}(x) \\ &\quad =(N+2 n+1)\sum_{j=0}^{n}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j)_{k} \binom{n-k-1}{j-k}\prod_{l=k+1}^{2 n-j}(N+l)\cdot x^{j} \\ &\qquad{} -(N+n)\sum_{j=0}^{n-1}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j-1)_{k} \binom{n-k-1}{j-k}\prod_{l=k+1}^{2 n-j-1}(N+l) \cdot x^{j+1} \\ &\quad =(N+2 n+1)\prod_{l=k+1}^{2 n}(N+l) \\ &\qquad{} +\sum_{j=1}^{n}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j)_{k} \binom{n-k-1}{j-k}\prod_{l=k+1}^{2 n-j+1}(N+l)\cdot x^{j} \\ &\qquad{}\times \sum_{j=1}^{n}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j)_{k} j \binom{n-k-1}{j-k}\prod_{l=k+1}^{2 n-j}(N+l) \cdot x^{j} \\ &\qquad{} +\sum_{j=1}^{n}\sum _{k=0}^{j-1}(-1)^{j-k}(2 n-j)_{k} \binom{n-k-1}{j-k-1}\prod_{l=k+1}^{2 n-j+1}(N+l)\cdot x^{j} \\ & \qquad{}-\sum_{j=1}^{n}\sum _{k=0}^{j-1}(-1)^{j-k}(2 n-j)_{k}(n-j+1) \binom{n-k-1}{j-k-1}\prod_{l=k+1}^{2 n-j}(N+l) \cdot x^{j}. \end{aligned}$$

Since

$$ \binom{n-k-1}{j-k}+\binom{n-k-1}{j-k-1}=\binom{n-k}{j-k} $$

and

$$\begin{aligned} &j\binom{n-k-1}{j-k}-(n-j+1)\binom{n-k-1}{j-k-1} \\ &\quad =k\binom{n-k}{j-k}-(k+1)\binom{n-k-1}{j-k-1}, \end{aligned}$$

we get

$$\begin{aligned} &(N+2 n+1)Q_{2 n}(x)-(N+n)x Q_{2 n-1}(x) \\ &\quad =(N+2 n+1)\prod_{l=k+1}^{2 n}(N+l) \\ &\qquad{} +\sum_{j=1}^{n}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j)_{k} \binom{n-k}{j-k}\prod_{l=k+1}^{2 n-j+1}(N+l)\cdot x^{j} \\ &\qquad{} +\sum_{j=1}^{n}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j)_{k} \biggl(k \binom{n-k}{j-k}-(k+1)\binom{n-k-1}{j-k-1} \biggr) \\ &\qquad{} \times \prod_{l=k+1}^{2 n-j}(N+l)\cdot x^{j}. \end{aligned}$$

Since

$$\begin{aligned} &(-1)^{j-k-1}(2 n-j)_{k+1}\binom{n-k-1}{j-k-1}\prod _{l=k+2}^{2 n-j+1}(N+l) \\ &\qquad{} +(-1)^{j-k}(2 n-j)_{k} \biggl(k\binom{n-k}{j-k}-(k+1) \binom{n-k-1}{j-k-1} \biggr)\prod_{l=k+1}^{2 n-j}(N+l) \\ &\qquad{} +(-1)^{j-k+1}(2 n-j)_{k}\binom{n-k}{j-k}\prod _{l=k+1}^{2 n-j}(N+l) \\ &\quad =(-1)^{j-k-1}(2 n-j+1)_{k+1}\binom{n-k-1}{j-k-1}\prod _{l=k+2}^{2 n-j+1}(N+l) \\ &\qquad{} +(-1)^{j-k-1}(k+1) (2 n-j)_{k+1}\binom{n-k-1}{j-k-1}\prod _{l=k+2} ^{2 n-j}(N+l), \end{aligned}$$

we have

$$\begin{aligned} &(N+2 n+1)Q_{2 n}(x)-(N+n)x Q_{2 n-1}(x) \\ &\qquad{} +\sum_{j=1}^{n}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j+1)_{k} \binom{n-k}{j-k}\prod_{l=k+1}^{2 n-j+1}(N+l) \cdot x^{j} \\ &\quad =Q_{2 n+1}(x). \end{aligned}$$

 □

Some more identities of hypergeometric Bernoulli numbers

Since $P_{2 n-1}(x)$, $P_{2 n}(x)$ and $Q_{2 n}(x)$ are polynomials with degree n and $Q_{2 n-1}(x)$ is a polynomial with degree $n-1$, by the approximation property of the continued fraction, we have the following.

Lemma 8

Let $P_{n}(x)/Q_{n}(x)$ denote the nth convergent of the continued fraction expansion of (14). Then for $n\ge 0$,

$$ Q_{n}(x)\sum_{\kappa =0}^{\infty }B_{N,\kappa } \frac{x^{\kappa }}{ \kappa !}\equiv P_{n}(x)\quad {\bigl(\operatorname{mod} x^{n+1}\bigr)}. $$

By this approximation property, the coefficients $x^{j}$ ($0\le j \le n$) of

$$ Q_{n}(x)\sum_{\kappa =0}^{\infty }B_{N,\kappa } \frac{x^{\kappa }}{ \kappa !}-P_{n}(x) $$

are nullified. By Theorem 4,

$$\begin{aligned} &Q_{2 n}(x)\sum_{\kappa =0}^{\infty }B_{N,\kappa } \frac{x^{\kappa }}{ \kappa !} \\ &\quad =\sum_{h=0}^{\infty }\sum _{j=0}^{\min \{h,n\}}\sum_{k=0}^{j}(-1)^{j-k}(2 n-j)_{k} \binom{n-k-1}{j-k}\prod_{l=k+1}^{2 n-j}(N+l) \cdot \frac{B_{N,h-j}}{(h-j)!}x^{h} \end{aligned}$$

and

$$ P_{2 n}(x)=\sum_{h=0}^{n}(-1)^{h} \binom{n}{h}\prod_{l=1}^{2 n-h}(N+l) \cdot x^{h}. $$

Therefore,

$$\begin{aligned} &\sum_{j=0}^{\min \{h,n\}}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j)_{k} \binom{n-k-1}{j-k}\prod_{l=k+1}^{2 n-j}(N+l)\cdot \frac{B_{N,h-j}}{(h-j)!} \\ &\quad = \textstyle\begin{cases} (-1)^{h}\binom{n}{h}\prod_{l=1}^{2 n-h}(N+l) &(0\le h\le n); \\ 0 &(h>n). \end{cases}\displaystyle \end{aligned}$$

Similarly, since

$$\begin{aligned} &Q_{2 n-1}(x)\sum_{\kappa =0}^{\infty }B_{N,\kappa } \frac{x^{\kappa }}{ \kappa !} \\ &\quad =\sum_{h=0}^{\infty }\sum _{j=0}^{\min \{h,n-1\}}\sum_{k=0}^{j}(-1)^{j-k}(2 n-j-1)_{k} \binom{n-k-1}{j-k} \\ &\qquad{} \times \prod_{l=k+1}^{2 n-j-1}(N+l)\cdot \frac{B_{N,h-j}}{(h-j)!}x ^{h} \end{aligned}$$

and

$$ P_{2 n-1}(x)=\sum_{h=0}^{n}(-1)^{h} \binom{n}{h}\prod_{l=1}^{2 n-h-1}(N+l) \cdot x^{h}, $$

we have

$$\begin{aligned} &\sum_{j=0}^{\min \{h,n\}}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j-1)_{k} \binom{n-k-1}{j-k}\prod_{l=k+1}^{2 n-j-1}(N+l) \cdot \frac{B_{N,h-j}}{(h-j)!} \\ &\quad= \textstyle\begin{cases} (-1)^{h}\binom{n}{h}\prod_{l=1}^{2 n-h-1}(N+l) &(0\le h\le n); \\ 0 &(h>n). \end{cases}\displaystyle \end{aligned}$$

Theorem 5

We have

$$\begin{aligned} &\sum_{j=0}^{\min \{h,n\}}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j)_{k} \binom{n-k-1}{j-k}\prod_{l=k+1}^{2 n-j}(N+l)\cdot \frac{B_{N,h-j}}{(h-j)!} \\ &\quad = \textstyle\begin{cases} (-1)^{h}\binom{n}{h}\prod_{l=1}^{2 n-h}(N+l) &(0\le h\le n); \\ 0 &(h>n), \end{cases}\displaystyle \end{aligned}$$

(17)

and

$$\begin{aligned} &\sum_{j=0}^{\min \{h,n\}}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j-1)_{k} \binom{n-k-1}{j-k}\prod_{l=k+1}^{2 n-j-1}(N+l) \cdot \frac{B_{N,h-j}}{(h-j)!} \\ &\quad = \textstyle\begin{cases} (-1)^{h}\binom{n}{h}\prod_{l=1}^{2 n-h-1}(N+l) &(0\le h\le n); \\ 0 &(h>n). \end{cases}\displaystyle \end{aligned}$$

(18)

In particular, when $N=1$, we have the relations for the classical Bernoulli numbers.

Corollary 4

We have

$$\begin{aligned} &\sum_{j=0}^{\min \{h,n\}}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j)_{k} \binom{n-k-1}{j-k}\frac{(2 n-j+1)!}{(k+1)!(2 n-h+1)!}\cdot \frac{B _{h-j}}{(h-j)!} \\ &\quad = \textstyle\begin{cases} (-1)^{h}\binom{n}{h} &(0\le h\le n); \\ 0 &(h>n), \end{cases}\displaystyle \end{aligned}$$

(19)

and

$$\begin{aligned} &\sum_{j=0}^{\min \{h,n\}}\sum _{k=0}^{j}(-1)^{j-k}(2 n-j-1)_{k} \binom{n-k-1}{j-k}\frac{(2 n-j)!}{(k+1)!(2 n-h)!}\cdot \frac{B_{h-j}}{(h-j)!} \\ &\quad = \textstyle\begin{cases} (-1)^{h}\binom{n}{h} &(0\le h\le n); \\ 0 &(h>n). \end{cases}\displaystyle \end{aligned}$$

(20)

Remark

Since

$$\begin{aligned} &\sum_{k=0}^{j}(-1)^{j-k} \frac{(2 n-j)_{k}}{(k+1)!}\binom{n-k-1}{j-k} \\ &\quad = \textstyle\begin{cases} \frac{1}{j+1}\binom{n}{j} &\text{if $j$ is even}; \\ \frac{1}{4 j}\binom{j-2}{(j-1)/2}^{-1}\binom{n-(j+1)/2}{(j-1)/2} \binom{n}{(j-1)/2} &\text{if $j$ is odd $\ge 3$}; \\ \frac{1}{2} &\text{if $j=1$}, \end{cases}\displaystyle \end{aligned}$$

we can write (19) as

$$\begin{aligned} &\sum_{j=0}^{ \lfloor \frac{h}{2} \rfloor }\frac{(2 n-2 j+1)!}{2 j+1} \binom{n}{2 j}\frac{B_{h-2 j}}{(h-2 j)!} + \frac{(2 n)!}{2}\frac{B_{h-1}}{(h-1)!} \\ &\qquad{} +\sum_{j=1}^{ \lfloor \frac{h-1}{2} \rfloor }\frac{(2 n-2 j)!}{4(2 j+1)} \binom{2 j-1}{j}^{-1}\binom{n-j-1}{j}\binom{n}{j} \frac{B _{h-2 j-1}}{(h-2 j-1)!} \\ &\quad = \textstyle\begin{cases} (-1)^{h}\binom{n}{h}(2 n-h+1)! &\text{if $1\le h\le n$}; \\ 0 &\text{if $n< h\le 2 n+1$}. \end{cases}\displaystyle \end{aligned}$$

Since

$$\begin{aligned} &\sum_{k=0}^{j}(-1)^{j-k} \frac{(2 n-j-1)_{k}}{(k+1)!} \binom{n-k-1}{j-k} \\ &= \textstyle\begin{cases} \frac{ ((j/2)! )^{2}}{(j+1)!}\binom{n}{j/2} \binom{n-j/2-1}{j/2} &\text{if $j$ is even}; \\ 0 &\text{if $j$ is odd}, \end{cases}\displaystyle \end{aligned}$$

we can write (20) as

$$\begin{aligned} &\sum_{j=0}^{ \lfloor \frac{h}{2} \rfloor }\frac{(j!)^{2}(2 n-2 j)!}{(2 j+1)!} \binom{n}{j}\binom{n-j-1}{j} \frac{B_{h-2 j}}{(h-2 j)!} \\ &\quad = \textstyle\begin{cases} (-1)^{h}\binom{n}{h}(2 n-h)! &\text{if $1\le h\le n$}; \\ 0 &\text{if $n< h\le 2 n$}. \end{cases}\displaystyle \end{aligned}$$

Here the empty summation is recognized as 0, as usual.