Molecular typing methods &amp; resistance mechanisms of MDR <i>Klebsiella pneumoniae</i>

Sunil Kumar; Razique Anwer; Arezki Azzi; Sunil Kumar; Razique Anwer; Arezki Azzi

doi:10.3934/microbiol.2023008

AIMS Microbiology

2023, Volume 9, Issue 1: 112-130. doi: 10.3934/microbiol.2023008

Previous Article Next Article

Review Special Issues

Molecular typing methods & resistance mechanisms of MDR Klebsiella pneumoniae

1.
Department of Microbiology, Kampala International University, Western Campus, Ishaka, Uganda
2.
Department of Pathology, College of Medicine, Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh, Saudi Arabia
3.
Department of Biochemistry, College of Medicine, Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh, Saudi Arabia

Received: 20 November 2022 Revised: 12 February 2023 Accepted: 20 February 2023 Published: 27 February 2023

The emergence and transmission of carbapenem-resistant Klebsiella pneumoniae (CRKP) have been recognized as a major public health concern. Here, we investigated the molecular epidemiology and its correlation with the mechanisms of resistance in CRKP isolates by compiling studies on the molecular epidemiology of CRKP strains worldwide. CRKP is increasing worldwide, with poorly characterized epidemiology in many parts of the world. Biofilm formation, high efflux pump gene expression, elevated rates of resistance, and the presence of different virulence factors in various clones of K. pneumoniae strains are important health concerns in clinical settings. A wide range of techniques has been implemented to study the global epidemiology of CRKP, such as conjugation assays, 16S-23S rDNA, string tests, capsular genotyping, multilocus sequence typing, whole-genome sequencing-based surveys, sequence-based PCR, and pulsed-field gel electrophoresis. There is an urgent need to conduct global epidemiological studies on multidrug-resistant infections of K. pneumoniae across all healthcare institutions worldwide to develop infection prevention and control strategies. In this review, we discuss different typing methods and resistance mechanisms to explore the epidemiology of K. pneumoniae pertaining to human infections.

Keywords:

Citation: Sunil Kumar, Razique Anwer, Arezki Azzi. Molecular typing methods & resistance mechanisms of MDR Klebsiella pneumoniae[J]. AIMS Microbiology, 2023, 9(1): 112-130. doi: 10.3934/microbiol.2023008

Related Papers:

[1]	Saad Ihsan Butt, Artion Kashuri, Muhammad Umar, Adnan Aslam, Wei Gao . Hermite-Jensen-Mercer type inequalities via Ψ-Riemann-Liouville k-fractional integrals. AIMS Mathematics, 2020, 5(5): 5193-5220. doi: 10.3934/math.2020334
[2]	Yousaf Khurshid, Muhammad Adil Khan, Yu-Ming Chu . Conformable integral version of Hermite-Hadamard-Fejér inequalities via η-convex functions. AIMS Mathematics, 2020, 5(5): 5106-5120. doi: 10.3934/math.2020328
[3]	M. Emin Özdemir, Saad I. Butt, Bahtiyar Bayraktar, Jamshed Nasir . Several integral inequalities for (α, s,m)-convex functions. AIMS Mathematics, 2020, 5(4): 3906-3921. doi: 10.3934/math.2020253
[4]	Yousaf Khurshid, Muhammad Adil Khan, Yu-Ming Chu . Conformable fractional integral inequalities for GG- and GA-convex functions. AIMS Mathematics, 2020, 5(5): 5012-5030. doi: 10.3934/math.2020322
[5]	Muhammad Uzair Awan, Nousheen Akhtar, Artion Kashuri, Muhammad Aslam Noor, Yu-Ming Chu . 2D approximately reciprocal ρ-convex functions and associated integral inequalities. AIMS Mathematics, 2020, 5(5): 4662-4680. doi: 10.3934/math.2020299
[6]	Muhammad Amer Latif, Mehmet Kunt, Sever Silvestru Dragomir, İmdat İşcan . Post-quantum trapezoid type inequalities. AIMS Mathematics, 2020, 5(4): 4011-4026. doi: 10.3934/math.2020258
[7]	Hengxiao Qi, Muhammad Yussouf, Sajid Mehmood, Yu-Ming Chu, Ghulam Farid . Fractional integral versions of Hermite-Hadamard type inequality for generalized exponentially convexity. AIMS Mathematics, 2020, 5(6): 6030-6042. doi: 10.3934/math.2020386
[8]	Ghulam Farid, Saira Bano Akbar, Shafiq Ur Rehman, Josip Pečarić . Boundedness of fractional integral operators containing Mittag-Leffler functions via (s,m)-convexity. AIMS Mathematics, 2020, 5(2): 966-978. doi: 10.3934/math.2020067
[9]	Tekin Toplu, Mahir Kadakal, İmdat İşcan . On n-Polynomial convexity and some related inequalities. AIMS Mathematics, 2020, 5(2): 1304-1318. doi: 10.3934/math.2020089
[10]	Gou Hu, Hui Lei, Tingsong Du . Some parameterized integral inequalities for p-convex mappings via the right Katugampola fractional integrals. AIMS Mathematics, 2020, 5(2): 1425-1445. doi: 10.3934/math.2020098

Abstract

1. Introduction and motivation

The Bernoulli numbers are defined by the exponential generating function:

$\frac{y}{e^y-1} = \sum\limits_{n = 0}^{\infty} B_n\frac{y^n}{n!}.$

For their wide applications to classical analysis (cf. Stromberg [47, Chapter 7], number theory (cf. Apostol [3, §12.12]), combinatorics [44, §3.4] and numerical mathematics (cf. Arfken ^[5]), these numbers appear frequently in the mathematical literature (see Comtet [17, §1.14], Graham et al. [26, §6.5] and Hansen [27, §50]).

There exist numerous interesting properties (cf. ^{[2,4,8,13,24]}); in particular, about recurrence relations (cf. ^[1,21,30,37]), reciprocities (cf. ^{[12,25,41,42,49]}), convolutions (cf. ^{[14,15,16,22,34]}), multiple sums (cf. ^{[10,11,19,32]}) and combinatorial applications (cf. ^[6,31,35,38]). A few of them are recorded here as examples:

● Arithmetic sums

$\sum\limits_{k = 1}^mk^n = \sum\limits_{j = 0}^n\frac{(m+1)^{j+1}}{n+1} \binom{n+1}{j+1}B_{n-j}.$

● Binomial recurrences

${\sum\limits_{k = 0}^n \binom{n}{k}B_k = (-1)^nB_n, {n\ge0};\\ \sum\limits_{k = 1}^{n-2} \binom{n}{k}k{B_k} = -n^2B_{n-1}, {n\ge3};\\ \sum\limits_{k = 0}^n \binom{n}{k} \frac{B_k}{2+n-k} = \frac{B_{n+1}}{n+1}, \qquad{n\ge0}.}$

● Convolutions of the Miki type (cf. ^{[12,22,34,36,40]})

$\begin{align*} {\sum\limits_{k = 1}^{\ell-1} \frac{B_{k}B_{\ell-k}}{k} -\sum\limits_{k = 2}^{\ell-1} \binom{\ell}{k} \frac{B_{k}B_{\ell-k}}{k} = H_{\ell}B_{\ell},\\ \sum\limits_{k = 0}^\ell B_{k}B_{\ell-k} -2\sum\limits_{k = 2}^\ell \binom{\ell+1}{k+1} \frac{B_{k}B_{\ell-k}}{k+2} = (\ell+1)B_{\ell}.} \end{align*}$

● Riemann zeta series

$\begin{align*} { \sum\limits_{k = 1}^{\infty}\frac{1}{k^{2n}} = (-1)^{n-1}\frac{2^{2n-1}B_{2n}}{(2n)!}\pi^{2n},\\ \sum\limits_{k = 1}^{\infty}\frac{(-1)^{k-1}}{k^{2n}} = (-1)^{n}\frac{(1-2^{2n-1})B_{2n}}{(2n)!}\pi^{2n},\\ \sum\limits_{k = 1}^{\infty}\frac{1}{(2k-1)^{2n}} = (-1)^{n}\frac{(1-2^{2n})B_{2n}}{2(2n)!}\pi^{2n}.} \end{align*}$

The aim of this paper is to examine and review systematically explicit formulae of Bernoulli numbers. Among known double sum expressions, the simplest one reads as

$B_n = \sum\limits_{j = 0}^n\sum\limits_{k = 0}^j\frac{(-1)^k}{j+1} \binom{j}{k}k^n = \sum\limits_{k = 0}^nk^n\sum\limits_{j = k}^n\frac{(-1)^k}{j+1} \binom{j}{k}.$

We observe that when the upper limit $n$ is replaced by $m\ge n$ , the last formula is still valid. Letting $\Omega(m, k)$ be the connection coefficients

$\Omega(m,k) = \sum\limits_{j = k}^m\frac{(-1)^k}{j+1} \binom{j}{k},$

we have the following formula (see Theorem 1) with an extra parameter $m$ :

$B_n = \sum\limits_{k = 0}^mk^n \Omega(m,k), \quad\text{where}\quad {m\ge n}.$

Three remarkable formulae can be highlighted in anticipation as exemplification (see Eqs (2.20), (3.14) and (4.1)), where for $m = n$ , the last two identities resemble those found respectively by Bergmann ^[7] and Gould [24, Eq (1.4)]:

${n+B_n = \sum\limits_{k = 0}^m(k+2)^{n} \sum\limits_{j = k}^m\frac{(-1)^{k}}{j+1} \binom{j}{k},\qquad{m\ge n\ge2};\\ \;\quad B_n = \sum\limits_{k = 1}^mk^n \sum\limits_{j = k}^m \frac{(-1)^{j-1}}{j(j+1)} \binom{m}{j},\qquad{m\ge n\ge2};\\ \;\quad B_n = \sum\limits_{k = 1}^mk^n \sum\limits_{j = k}^m(-1)^{k-1} \binom{j-1}{k-1}H_j, \qquad{m > n\ge1}.}$

The rest of the paper will be organized as follows. In the next section, we shall establish several representation formulae of $B_n$ by parameterizing known double sums with $m$ . Then in Section 3, by examining equivalent expressions for $\Omega(m, k)$ and another connection coefficient $\omega(m, k)$ , we shall prove further explicit formulae for Bernoulli numbers. Finally, the paper will end in Section 4, where more summation formulae will be shown.

Throughout the paper, we shall frequently make use of the following notations. Let $\mathbb{{N}}$ be the set of natural numbers with $\mathbb{{N}}_0 = \{0\}\cup\mathbb{{N}}$ . For $n\in\mathbb{{N}}_0$ and an indeterminate $x$ , the shifted factorial is defined by

$(x)_0\equiv1\quad\text{and}\quad (x)_n = \prod\limits_{k = 0}^{n-1}(x+k) \quad\text{for}\quad n\in\mathbb{{N}}.$

The harmonic numbers $H_n$ are given by the partial sums $H_n = \sum_{k = 1}^n\frac1k, \; \text{where}\; n\in\mathbb{{N}}.$

2. Double sum representations

Denote by $[y^n]\phi(y)$ the coefficient of $y^n$ in the formal power series $\phi(y)$ . Recall the exponential generating function of the Bernoulli numbers

$\frac{y}{e^y-1} = \sum\limits_{n = 0}^{\infty} \frac{B_n}{n!}y^n.$

Expanding this function into the series

$\frac{y}{e^y-1} = \frac{\ln\{1+(e^y-1)\}}{e^y-1} = \sum\limits_{j = 0}^{\infty} \frac{(-1)^j}{j+1}(e^y-1)^j,$

we get, for $m\ge n$ , the following expression

$\begin{align*} {B_n = n![y^n]\sum\limits_{j = 0}^{m} \frac{(-1)^j}{j+1}(e^y-1)^j = n!\sum\limits_{j = 0}^{m}(-1)^j \frac{j!}{j+1}[y^n]\frac{(e^y-1)^j}{j!} = \sum\limits_{j = 0}^{m}(-1)^j \frac{j!}{j+1}S_2(n,j),} \end{align*}$

where $S_2(n, j)$ is the Stirling number of the second kind

$\begin{align} {S_2(n,j) = n![y^n]\frac{(e^y-1)^j}{j!} = \frac1{j!}\sum\limits_{k = 0}^j(-1)^{j-k} \binom{j}{k}k^n.} \end{align}$

(2.1)

Therefore, we have established, by substitution, the following explicit formula.

Theorem 1 ( $m, \; n\in\mathbb{{N}}_0$ with $m\ge n$ ).

$B_n = \sum\limits_{j = 0}^m\sum\limits_{k = 0}^j\frac{(-1)^k}{j+1} \binom{j}{k}k^n = \sum\limits_{k = 0}^mk^n\sum\limits_{j = k}^m\frac{(-1)^k}{j+1} \binom{j}{k}.$

This fundamental result will be the starting point for us to examine explicit formulae of Bernoulli numbers. When $m = n+1$ , the corresponding formula can be located in Jordan [, §78, Page 236]. Instead, its $m = n$ case is well-known; that can be found in Cook ^[18], Gould [23, Eq (1)] and [24, Eq (1.3)], Higgens ^[28], Quaintance and Gould [43, Eq (15.2)].

2.1. Connection coefficients $\Omega(m, k)$

Define the coefficients $\Omega(m, k)$ by

$\begin{equation} { \Omega(m,k): = \sum\limits_{j = k}^m \frac{(-1)^k}{j+1} \binom{j}{k}.} \end{equation}$

(2.2)

We can rewrite the basic formula in Theorem 1 as

$\begin{equation} {B_n = \sum\limits_{k = 0}^mk^n \Omega(m,k), \quad\text{where}\quad{m\ge n}.} \end{equation}$

(2.3)

Lemma 2. For $m\ge k$ , the coefficients $\Omega(m, k)$ satisfy the recurrence relations:

$\begin{align} \Omega(m,k)- \Omega(m-1,k) = \frac{(-1)^k}{m+1} \binom{m}{k}, \end{align}$

(2.4)

$\begin{align} \Omega(m,k)- \Omega(m,k-1) = \frac{(-1)^k}{k} \binom{m+1}{k}. \end{align}$

(2.5)

Proof. The first one (2.4) follows directly from the definition of $\Omega(m, k)$ . The second one can be done as follows

$\Omega(m,k)- \Omega(m,k-1) = \sum\limits_{j = k}^m \frac{(-1)^k}{j+1} \binom{j}{k} +\sum\limits_{j = k-1}^m \frac{(-1)^{k}}{j+1} \binom{j}{k-1}\\ \;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\; = \sum\limits_{j = k-1}^m\frac{(-1)^k}{j+1} \Bigg\{ \binom{j}{k}+ \binom{j}{k-1}\Bigg\}\\ \;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\; = \sum\limits_{j = k-1}^m\frac{(-1)^k}{j+1} \binom{j+1}{k}\\ \;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\; = \frac{(-1)^k}{k}\sum\limits_{j = k-1}^m \binom{j}{k-1},$

which confirms (2.5) after having evaluated the binomial sum

$\sum\limits_{j = k-1}^m \binom{j}{k-1} = \binom{m+1}{k}.$

□

In addition, the lower triangular matrix

$\Omega_m: = \big[ \Omega(i,j)\big]_{1\le i,j\le m}$

with diagonal elements

$\Omega(k,k) = \frac{(-1)^k}{k+1}$

is invertible. We can determine its inverse explicitly by

$\Omega_m^{-1} = \Bigg[(-1)^j \binom{i}{j} \frac{1+2i+ij}{1+j}\Bigg]_{1\le i,j\le m}.$

2.2. Formulae of Fekih-Ahmed ^[20]

Similar to the formula in Theorem 1, we have the following three variants.

Proposition 3 ( $m, \; n\in\mathbb{{N}}$ ).

$B_n = \sum\limits_{k = 1}^{m}k^{n+1}\sum\limits_{j = k}^{m} \frac{(-1)^{k-1}}{j^2} \binom{j}{k},\;\;\;\;\;\;\;\;\;\;\;\;{m > n\ge2};$

(2.6)

$B_n = \sum\limits_{k = 1}^{m}k^{n}\sum\limits_{j = k}^{m} \frac{(-1)^{k-1}}{j(j+1)} \binom{j}{k},\;\;\;\;\;\;\;\;\;\;\;\;{m\ge n\ge2};$

(2.7)

$B_n = \sum\limits_{k = 1}^{m}k^{n}\sum\limits_{j = k}^{m} (-1)^{k}\frac{2j+1}{j(j+1)} \binom{j}{k},\;\;\;\;\;\;\;\;\;\;\;\;\qquad{m\ge n\ge2}.$

(2.8)

Among these formulae, the first two reduce, for $m = n+1$ and $m = n$ , to Fekih-Ahmed [20, Eqs (5) and (6)], respectively.

Proof. According to (2.5), we have, for $m\ge n > 1$ , the following equalities:

$\begin{aligned} {B_n = \sum\limits_{k = 1}^mk^n \Omega(m,k)\\ \;\;\;\; = \sum\limits_{k = 1}^m(-1)^k \binom{m+1}{k}k^{n-1} +\sum\limits_{k = 1}^mk^n \Omega(m,k-1)\\ \;\;\;\; = (-1)^m(m+1)^{n-1} +\sum\limits_{k = 1}^mk^n\sum\limits_{i = k-1}^m \frac{(-1)^{k-1}}{i+1} \binom{i}{k-1}.} \end{aligned}$

Simplifying the last line

$\begin{equation} {B_n = \sum\limits_{k = 1}^{m+1}k^n\sum\limits_{i = k-1}^{m} \frac{(-1)^{k-1}}{i+1} \binom{i}{k-1}, \quad(m\ge n\ge2)} \end{equation}$

(2.9)

and then reformulating it as

$B_n = \sum\limits_{k = 1}^{m+1}k^{n+1}\sum\limits_{i = k-1}^{m} \frac{(-1)^{k-1}}{(i+1)^2} \binom{i+1}{k},$

we confirm (2.6) under the replacements " $m\to m-1$ " and " $i\to j-1$ ".

Observe further that for $m\ge n$ , the double sum vanishes

$\begin{equation} { \sum\limits_{k = 1}^{m}k^{n}\sum\limits_{j = k}^{m} \frac{(-1)^{k}}{j} \binom{j}{k} = 0, \quad(m\ge n\ge2),} \end{equation}$

(2.10)

which is justified by the finite differences

$\sum\limits_{k = 1}^{m}(-1)^{k}k^{n-1} \sum\limits_{j = k}^{m} \binom{j-1}{k-1} = \sum\limits_{k = 1}^{m}(-1)^{k} \binom{m}{k}k^{n-1} = 0.$

Then (2.7) and (2.8) follow respectively from the difference and sum between Eq (2.10) and that in Theorem 1. □

Besides (2.10) and the formula in Theorem 1, we also have the following counterparts.

Theorem 4 ( $m, \; n\in\mathbb{{N}}$ with $m\geq n\ge1$ ).

$\begin{aligned} \sum\limits_{k = 1}^mk^{n} \sum\limits_{j = k}^m\frac{(-1)^{k}}{j+2} \binom{j}{k} = \begin{cases} B_n,\;\;\;\;\;\;n\equiv_20;\\ B_{n+1},\;\;\;\;\;\;n\equiv_21. \end{cases} \end{aligned}$

(2.11)

$\begin{aligned} \sum\limits_{k = 1}^mk^{n} \sum\limits_{j = k}^m\frac{(-1)^{k}}{j+3} \binom{j}{k} = \begin{cases} B_n+\frac{1}2B_{n+2},\;\;\;\;\;\;n\equiv_20;\\ \frac{3}2B_{n+1},\;\;\;\;\;\;n\equiv_21. \end{cases} \end{aligned}$

(2.12)

Proof. In accordance with the binomial relation

$\begin{equation} { \binom{j}{k} = \binom{j+1}{k}- \binom{j}{k-1},} \end{equation}$

(2.13)

we can write the sum in (2.11) as " $A+B$ ", where

$\begin{align*} A& = \sum\limits_{k = 0}^mk^{n} \sum\limits_{j = k}^m\frac{(-1)^{k}}{j+2} \binom{j+1}{k},\\ B& = \sum\limits_{k = 0}^mk^{n} \sum\limits_{j = k}^m\frac{(-1)^{k-1}}{j+2} \binom{j}{k-1}. \end{align*}$

Replacing the summation index $j$ by $i-1$ in " $A$ ", we can reformulate it as follows:

$\begin{align*} A = &\sum\limits_{k = 0}^mk^{n} \sum\limits_{i = k+1}^{m+1}\frac{(-1)^{k}}{i+1} \binom{i}{k}\\ = &\sum\limits_{k = 0}^{m+1}k^{n} \sum\limits_{i = k}^{m+1}\frac{(-1)^{k}}{i+1} \binom{i}{k} -\sum\limits_{k = 0}^{m+1}(-1)^k\frac{k^n}{k+1}. \end{align*}$

Recalling Theorem 1, we deduce the expression

$\begin{equation} {A = B_n-\sum\limits_{k = 0}^{m+1} (-1)^k\frac{k^n}{k+1}.} \end{equation}$

(2.14)

When $n > 1$ , applying first the partial fractions and then making the replacement " $j\to i-1$ ", we can rewrite " $B$ " as

$\begin{align*} B = &\sum\limits_{k = 1}^mk^{n+1} \sum\limits_{j = k}^m\frac{(-1)^{k-1}}{(j+1)(j+2)} \binom{j+1}{k}\\ = &\sum\limits_{k = 1}^mk^{n+1} \sum\limits_{j = k}^m\frac{(-1)^{k-1}}{j+1} \binom{j+1}{k} +\sum\limits_{k = 1}^mk^{n+1} \sum\limits_{j = k}^m\frac{(-1)^{k}}{j+2} \binom{j+1}{k}\\ = &\sum\limits_{k = 1}^mk^{n+1} \sum\limits_{i = k+1}^{m+1}\frac{(-1)^{k}}{i+1} \binom{i}{k} -\sum\limits_{k = 1}^mk^{n+1} \sum\limits_{i = k+1}^{m+1}\frac{(-1)^{k}}{i} \binom{i}{k}. \end{align*}$

By appealing to Theorem 1 and (2.10), we reduce the last expression to the following one:

$\begin{equation} \begin{aligned}[{c}] B& = B_{n+1}+\sum\limits_{k = 1}^{m+1}(-1)^{k}k^{n} -\sum\limits_{k = 1}^{m+1}(-1)^{k}\frac{k^{n+1}}{k+1} = B_{n+1}+\sum\limits_{k = 1}^{m+1}(-1)^{k}\frac{k^{n}}{k+1}. \end{aligned}\end{equation}$

(2.15)

Putting together (2.14) and (2.15), we find that

$A+B = B_{n}+B_{n+1},$

which is equivalent to the expression in (2.11).

Similarly, by making use of (2.13), we can write the sum (2.12) as " $C+D$ ", where

$\begin{align*} C& = \sum\limits_{k = 1}^mk^{n} \sum\limits_{j = k}^m\frac{(-1)^{k}}{j+3} \binom{j+1}{k},\\ D& = \sum\limits_{k = 1}^mk^{n} \sum\limits_{j = k}^m\frac{(-1)^{k-1}}{j+3} \binom{j}{k-1}. \end{align*}$

Replacing the summation index $j$ by $i-1$ in " $C$ ", we can manipulate it as follows:

$\begin{align*} C = &\sum\limits_{k = 1}^mk^{n} \sum\limits_{i = k+1}^{m+1}\frac{(-1)^{k}}{i+2} \binom{i}{k} = \sum\limits_{k = 1}^{m+1}k^{n} \sum\limits_{i = k}^{m+1}\frac{(-1)^{k}}{i+2} \binom{i}{k} -\sum\limits_{k = 1}^{m+1}(-1)^k\frac{k^n}{k+2}. \end{align*}$

Evaluating the first sum by (2.11), we obtain the expression

$\begin{equation} C = B_n+B_{n+1} -\sum\limits_{k = 1}^{m+1}(-1)^k\frac{k^n}{k+2}. \end{equation}$

(2.16)

We can analogously treat " $D$ " as follows:

$\begin{align*} D = &\sum\limits_{k = 1}^mk^{n+1} \sum\limits_{j = k}^m\frac{(-1)^{k+1}}{(j+1)(j+3)} \binom{j+1}{k}\\ = &\frac{1}2\sum\limits_{k = 1}^mk^{n+1} \sum\limits_{j = k}^m\frac{(-1)^{k}}{j+3} \binom{j+1}{k} -\frac{1}2\sum\limits_{k = 1}^mk^{n+1} \sum\limits_{j = k}^m\frac{(-1)^{k}}{j+1} \binom{j+1}{k}\\ = &\frac{1}2\sum\limits_{k = 1}^{m}k^{n+1} \sum\limits_{i = k+1}^{m+1}\frac{(-1)^{k}}{i+2} \binom{i}{k} -\frac{1}2\sum\limits_{k = 1}^{m}k^{n+1} \sum\limits_{i = k+1}^{m+1}\frac{(-1)^{k}}{i} \binom{i}{k}. \end{align*}$

Applying (2.10) and (2.11), we can further simplify the last expression

$\begin{align} D& = \frac{B_{n+1}+B_{n+2}}{2} -\frac{1}2\sum\limits_{k = 1}^{m+1}(-1)^{k} \frac{k^{n+1}}{k+2} +\frac{1}2\sum\limits_{k = 1}^{m+1}(-1)^{k}k^{n}\\ & = \frac{B_{n+1}+B_{n+2}}{2} +\sum\limits_{k = 1}^{m+1}(-1)^{k} \frac{k^{n}}{k+2}. \end{align}$

(2.17)

Finally, putting (2.16) and (2.17), we arrive at

$C+D = B_n+\frac{3B_{n+1}+B_{n+2}}{2},$

which proves the second identity (2.12). □

2.3. Four variants with $k$ being shifted

Furthermore, there are four similar sums that can be expressed in closed forms in Bernoulli numbers.

Theorem 5 ( $m, \; n\in\mathbb{{N}}$ ).

$\begin{align*} &\sum\limits_{k = 0}^m(k+1)^{n} \sum\limits_{i = k}^m\frac{(-1)^{k}}{i+1} \binom{i}{k} = B_n, &&{m\ge n\ge2}; \end{align*}$

(2.18)

$\begin{align*} &\sum\limits_{k = 0}^m(k+1)^{n} \sum\limits_{i = k}^m\frac{(-1)^{k}}{i+2} \binom{i}{k} = B_{n+1}, &&{m\ge n\ge1}; \end{align*}$

(2.19)

$\begin{align*} &\sum\limits_{k = 0}^m(k+2)^{n} \sum\limits_{i = k}^m\frac{(-1)^{k}}{i+1} \binom{i}{k} = n+B_n, &&{m\ge n\ge2}; \end{align*}$

(2.20)

$\begin{align*} &\sum\limits_{k = 0}^m(k+2)^{n} \sum\limits_{i = k}^m\frac{(-1)^{k}}{i+2} \binom{i}{k} = 1-B_{n}+B_{n+1}, &\quad&{m\ge n\ge1}. \end{align*}$

(2.21)

Proof. The first one (2.18) is deduced from (2.9) under the replacement " $k\to k+1$ ".

By splitting the sum in (2.19) into two, then making the replacements " $i\to j-1, \; k\to k-1$ " for the former and " $k\to k-1$ " for the latter, we can confirm the second identity (2.19) as follows:

$\begin{align*} &\sum\limits_{k = 0}^m(k+1)^{n} \sum\limits_{i = k}^m\frac{(-1)^{k}}{i+2} \binom{i}{k}\\ & = \sum\limits_{k = 0}^m(k+1)^{n} \sum\limits_{i = k}^m\frac{(-1)^{k}}{i+2} \bigg\{ \binom{i+1}{k+1}- \binom{i}{k+1}\bigg\}\\ & = \sum\limits_{k = 1}^{m+1}k^{n} \sum\limits_{j = k}^{m+1}\frac{(-1)^{k-1}}{j+1} \binom{j}{k} +\sum\limits_{k = 1}^{m+1}k^{n} \sum\limits_{i = k-1}^m\frac{(-1)^{k}}{i+2} \binom{i}{k}\\ & = \sum\limits_{k = 1}^{m}k^{n} \sum\limits_{i = k}^m\frac{(-1)^{k}}{i+2} \binom{i}{k} -\sum\limits_{k = 1}^{m+1}k^{n} \sum\limits_{j = k}^{m+1}\frac{(-1)^{k}}{j+1} \binom{j}{k}\\ & = (B_{n}+B_{n+1})-B_{n} = B_{n+1}. \end{align*}$

According to (2.13), we can write the third sum in (2.20) as " $E+F$ ", where

$\begin{align*} E& = \sum\limits_{k = 0}^m(k+2)^{n} \sum\limits_{i = k}^m\frac{(-1)^{k}}{i+1} \binom{i+1}{k+1},\\ F& = \sum\limits_{k = 0}^m(k+2)^{n} \sum\limits_{i = k}^m\frac{(-1)^{k-1}}{i+1} \binom{i}{k+1}. \end{align*}$

The sum " $E$ " can be evaluated by

$\begin{align*} E& = \sum\limits_{k = 0}^m(-1)^{k} \frac{(k+2)^{n}}{k+1} \sum\limits_{i = k}^m \binom{i}{k}\\ & = \sum\limits_{k = 0}^m(-1)^{k} \frac{(k+2)^{n}}{k+1} \binom{m+1}{k+1}\\ & = \sum\limits_{i = 0}^n \binom{n}{i} \sum\limits_{k = 0}^m(-1)^{k} \binom{m+1}{k+1} (k+1)^{i-1}. \end{align*}$

Because the above inner sum results in zero for $2\le i\le n$ , there remain, for " $E$ ", only two terms corresponding to $i = 1$ and $i = 0$ :

$\begin{equation} E = n+\sum\limits_{k = 0}^m \frac{(-1)^{k}}{k+1} \binom{m+1}{k+1} = n+H_{m+1}. \end{equation}$

(2.22)

The sum " $F$ " can be restated, under " $k\to k-1$ ", as

$\begin{align*} F& = \sum\limits_{k = 1}^{m+1}(k+1)^{n} \sum\limits_{i = k-1}^m\frac{(-1)^{k}}{i+1} \binom{i}{k}\\ & = \sum\limits_{k = 1}^{m}(k+1)^{n} \sum\limits_{i = k}^m\frac{(-1)^{k}}{i+1} \binom{i}{k}\\ & = \sum\limits_{k = 0}^{m}(k+1)^{n} \sum\limits_{i = k}^m\frac{(-1)^{k}}{i+1} \binom{i}{k} -\sum\limits_{i = 0}^m\frac{1}{i+1}. \end{align*}$

Evaluating the former sum by (2.18), we find that

$\begin{equation} F = B_n-H_{m+1}. \end{equation}$

(2.23)

Then the third identity (2.20) follows by putting (2.22) and (2.23) together.

Finally, for (2.21), write that sum as " $G+H$ ", where

$\begin{align*} G& = \sum\limits_{k = 0}^m(k+2)^{n} \sum\limits_{i = k}^m\frac{(-1)^{k}}{i+2} \binom{i+1}{k+1},\\ H& = \sum\limits_{k = 0}^m(k+2)^{n} \sum\limits_{i = k}^m\frac{(-1)^{k-1}}{i+2} \binom{i}{k+1}. \end{align*}$

By making use of (2.18) and (2.7), we can evaluate

$\begin{align*} G& = \sum\limits_{k = 1}^{m+1}(k+1)^{n} \sum\limits_{j = k}^{m+1}\frac{(-1)^{k-1}}{j+1} \binom{j}{k} = H_{m+2}-B_n,\\ H& = \sum\limits_{k = 0}^m(k+2)^{n+1} \sum\limits_{i = k}^m\frac{(-1)^{k-1}}{(i+1)(i+2)} \binom{i+1}{k+2}\\ & = \sum\limits_{k = 2}^{m+1}k^{n+1} \sum\limits_{j = k}^{m+1}\frac{(-1)^{k+1}}{j(j+1)} \binom{j}{k}\\ & = B_{n+1}-\sum\limits_{j = 1}^{m+1}\frac1{j+1} = 1+B_{n+1}-H_{m+2}. \end{align*}$

It follows consequently that

$G+H = 1-B_n+B_{n+1},$

which coincides with the right-hand side of (2.21).□

3. Further explicit expressions

In this section, we shall first prove a binomial identity. Then it will be utilized to derive equivalent expressions for the connection coefficients $\Omega(m, k)$ and $\omega(m, k)$ . These equivalent forms will be useful in proving further explicit formulae for Bernoulli numbers.

3.1. A binomial sum identity

We begin with the following binomial identity.

Theorem 6. For two indeterminates $x, y$ and $m, k\in\mathbb{{N}}_0$ with $m\ge k$ , the following algebraic identity holds:

$\begin{align*} &\sum\limits_{j = k}^m\frac{(x-j)_k}{(1+y)_k(1-x+y+j)}\\ &\: = \sum\limits_{i = k}^{m}\bigg\{ \frac{(x-i)_k}{(1+y+m-i)_{k+1}} +\frac{(x-k)_{k+1}}{(1-x+y+i)(1+y-k+i)_{k+1}}\bigg\}\\ &\: = \sum\limits_{i = k}^{m}\bigg\{ \frac{(x-m+i-k)_k}{(1+y-k+i)_{k+1}} +\frac{(x-k)_{k+1}}{(1-x+y+i)(1+y-k+i)_{k+1}}\bigg\}. \end{align*}$

Proof. We prove the theorem by examining the double sum

$\mathrm{S}: = \sum\limits_{i = k}^m\sum\limits_{j = i}^m \Lambda(i,j), \quad\text{where}\quad \Lambda(i,j): = \frac{(k+1)(x-i)_{k}}{(y-i+j)_{k+2}}.$

For the given $\lambda'_j$ -sequence below, it is routine to check its difference

$\lambda'_j = \frac{(x-i)_{k}}{(y-i+j)_{k+1}}, \qquad \lambda'_j- \lambda'_{j+1} = \Lambda(i,j).$

Therefore, we can manipulate $\mathrm{S}$ by telescoping as follows:

$\mathrm{S} = \sum\limits_{i = k}^m\sum\limits_{j = i}^m \Lambda(i,j) = \sum\limits_{i = k}^m\sum\limits_{j = i}^m\big\{ \lambda'_j- \lambda'_{j+1}\big\} = \sum\limits_{i = k}^m\big\{ \lambda'_i- \lambda'_{m+1}\big\},$

which can be restated as

$\begin{equation} { \mathrm{S} = \sum\limits_{i = k}^m\bigg\{\frac{(x-i)_{k}}{(y)_{k+1}} -\frac{(x-i)_{k}}{(1+y-i+m)_{k+1}}\bigg\}.} \end{equation}$

(3.1)

Alternatively, for another $\lambda''_i$ -sequence, we have

$\lambda''_i: = \frac{(x-i)_{k+1}}{(1+y-i+j)_{k+1}}, \qquad \lambda''_i- \lambda''_{i+1} = (1-x+y+j) \Lambda(i,j).$

Hence, we can reformulate $\mathrm{S}$ analogously as follows:

$\mathrm{S} = \sum\limits_{j = k}^m\sum\limits_{i = k}^j \Lambda(i,j) = \sum\limits_{j = k}^m\sum\limits_{i = k}^j\frac{ \lambda''_i- \lambda''_{i+1}}{1-x+y+j} = \sum\limits_{j = k}^m\frac{ \lambda''_k- \lambda''_{j+1}}{1-x+y+j},$

which can be rewritten explicitly

$\begin{equation} { \mathrm{S} = \sum\limits_{j = k}^m\bigg\{\frac{(x-k)_{k+1}}{(1-x+y+j)(1+y-k+j)_{k+1}} -\frac{(x-j-1)_{k+1}}{(1-x+y+j)(y)_{k+1}}\bigg\}.} \end{equation}$

(3.2)

By relating (3.1) to (3.2), we derive the equality

$\begin{align*} &\sum\limits_{i = k}^m\frac{(x-i)_{k}}{(1+y-i+m)_{k+1}} +\sum\limits_{j = k}^m\frac{(x-k)_{k+1}}{(1-x+y+j)(1+y-k+j)_{k+1}}\\ = &\sum\limits_{i = k}^m\frac{(x-i)_{k}}{(y)_{k+1}} +\sum\limits_{j = k}^m\frac{(x-j-1)_{k+1}}{(1-x+y+j)(y)_{k+1}}\\ = &\sum\limits_{j = k}^m\frac{(x-j)_{k}}{(1-x+y+j)(1+y)_{k}}, \end{align*}$

which is equivalent to the expression in the theorem.□

When $x = y = 0$ , Theorem 6 reduces to the crucial identity used by Komatsu and Pita-Ruiz [31, Eq (27)].

$\sum\limits_{j = k}^m \frac{m+1}{j+1} \binom{j}{k} = \sum\limits_{i = k}^m \frac{ \binom{m+1}{i-k}}{ \binom{m}{i}} = \sum\limits_{i = k}^m \frac{ \binom{m+1}{m-i}}{ \binom{m}{i-k}}.$

From this, we deduce the equivalent expressions below

$\begin{equation} { \Omega(m,k) = \sum\limits_{i = k}^m\frac{(-1)^k}{m+1} \frac{ \binom{m+1}{i-k}}{ \binom{m}{i}} = \sum\limits_{i = k}^m\frac{(-i)_k}{(1+m-i)_{k+1}}.} \end{equation}$

(3.3)

This leads us to the following formula which reduces, for $m = n$ , to Munch ^[39] (cf. Gould [24, Eq (1.8)], Quaintance and Gould [43, Eq (15.7)]).

Theorem 7 ( $m\ge n\ge1$ ).

$B_n = \sum\limits_{k = 1}^mk^n \sum\limits_{i = k}^m\frac{(-i)_k}{(1+m-i)_{k+1}} = \sum\limits_{k = 1}^mk^n \sum\limits_{i = k}^m\frac{(-1)^k}{m+1} \frac{ \binom{m+1}{i-k}}{ \binom{m}{i}}.$

3.2. Connection coefficients $\omega(m, k)$

Consider the difference

$\begin{align*} &\sum\limits_{k = 1}^mk^n\sum\limits_{i = k}^m \bigg\{\frac{(1-i)_{k-1}}{(2+m-i)_{k}} -\frac{(-i)_k}{(1+m-i)_{k+1}}\bigg\}\\ = &\sum\limits_{k = 1}^mk^n\sum\limits_{i = k}^m \frac{(1-i)_{k-1}}{(1+m-i)_{k+1}}(m+1)\\ = &\sum\limits_{k = 1}^mk^n\sum\limits_{i = k}^m \frac{ \lambda_i- \lambda_{i+1}}{k} \text{ where } \lambda_i = \frac{(1-i)_{k}}{(2+m-i)_{k}}\\ = &\sum\limits_{k = 1}^m(-1)^{k-1} \binom{m}{k}k^{n-1} = 0,\qquad{m\ge n > 1}. \end{align*}$

We infer that the formula in Theorem 7 is equivalent to the following one.

Theorem 8 ( $m\ge n\ge2$ ).

$\begin{equation} {B_n = \sum\limits_{k = 1}^mk^n \sum\limits_{i = k}^m\frac{(-1)^{k-1}}{m+1} \frac{ \binom{m+1}{i-k}}{ \binom{m}{i-1}}.} \end{equation}$

(3.4)

Its special case $m = n$ can be found in Gould [24, Eq (1.9)], Quaintance and Gould [43, Eq (15.5)] and Shanks ^[45]. However, the formula produced by Komatsu and Pita–Ruiz [31, Eq (2)] is incorrect.

The last formula can be rewritten as

$\begin{equation} { {B_n = \sum\limits_{k = 1}^mk^n \omega(m,k)},} \end{equation}$

(3.5)

where the connection coefficients are defined by

$\begin{equation} { { \omega(m,k) = \sum\limits_{i = k}^m \frac{(1-i)_{k-1}}{(2+m-i)_{k}} = \sum\limits_{i = k}^m\frac{(-1)^{k-1}}{m+1} \frac{ \binom{m+1}{i-k}}{ \binom{m}{i-1}}.}} \end{equation}$

(3.6)

It is obvious that the matrix of the connection coefficients

$\omega_m: = \big[ \omega(i,j)\big]_{1\le i,j\le m}$

with diagonal entries

$\omega(k,k) = \frac{(-1)^{k+1}}{k(k+1)}$

is lower triangular and invertible. It is not difficult to check that its inverse is given explicitly by

$\omega_m^{-1} = \bigg[(-1)^{j+1} \binom{i}{j} (2i-j+ij)\bigg]_{1\le i,j\le m}.$

Observing further that

$\omega(m,k) = \sum\limits_{j = k-1}^{m-1} \frac{(-j)_{k-1}}{(1+m-j)_{k}},$

we can prove the following interesting lemma.

Lemma 9. The connection coefficients satisfy the properties:

● Relations between $\Omega(m, k)$ and $\omega(m, k)$

$\begin{equation} \begin{aligned}[{c}] \omega(m,k)& = \Omega(m,k-1) -\frac{(-m)_{k-1}}{k!},\\ \Omega(m,k)& = \omega(m,k+1) +\frac{(-m)_{k}}{(k+1)!}. \end{aligned} \end{equation}$

(3.7)

● Recurrence relations: $m, k\in\mathbb{{N}}$

$\begin{align} \omega(m,k)- \omega(m,k-1) & = \frac{(-1)^{k-1}}{k(k-1)} \binom{m}{k-1}, \end{align}$

(3.8)

$\begin{align} \omega(m,k)- \omega(m-1,k) & = \frac{(-1)^{k-1}}{m(m+1)} \binom{m}{k}. \end{align}$

(3.9)

● Equivalent expression: $m, k\in\mathbb{{N}}$

$\begin{equation} \omega(m,k) = \sum\limits_{j = k}^{m}\frac{(-1)^{k-1}}{j(j+1)} \binom{j}{k}. \end{equation}$

(3.10)

Proof. The recurrence relations (3.8) and (3.9) follow by combining (3.7) with (2.4) and (2.5). The equivalent expression displayed in (3.10) is obtained by iterating (3.9), which has already appeared in (2.7). □

The connection coefficients $\Omega(m, k)$ and $\omega(m, k)$ are related to the harmonic numbers in the following manners.

Proposition 10 (Equivalent expressions: $m, k\in\mathbb{{N}}$ ).

$\begin{align} \Omega(m,k)& = H_{m+1}+\sum\limits_{i = 1}^k\frac{(-1)^i}{i} \binom{m+1}{i} = \sum\limits_{i = k}^m\frac{(-1)^i}{i+1} \binom{m+1}{i+1}, \end{align}$

(3.11)

$\begin{align} \omega(m,k)& = H_{m+1}-1 +\sum\limits_{i = 1}^{k-1}\frac{(-1)^i}{i(i+1)} \binom{m}{i} = \sum\limits_{i = k}^{m}\frac{(-1)^{i-1}}{i(i+1)} \binom{m}{i}. \end{align}$

(3.12)

Proof. By iterating the relation (2.5) $k$ -times, we find that

$\Omega(m,k) = \Omega(m,0) +\sum\limits_{i = 1}^k\frac{(-1)^i}{i} \binom{m+1}{i}$

which becomes the first expression in (3.11) since $\Omega(m, 0) = H_{m+1}$ . The second expression in (3.11) follows by the inverse pair

$H_n = \sum\limits_{i = 1}^n\frac{(-1)^{i-1}}{i} \binom{n}{i} \quad\text{and}\quad \frac{1}{n} = \sum\limits_{i = 1}^n(-1)^{i-1} \binom{n}{i}H_i.$

Analogously, by iterating the relation (3.8) $k$ -times, we have that

$\omega(m,k) = \omega(m,1) +\sum\limits_{i = 1}^{k-1}\frac{(-1)^i}{i(i+1)} \binom{m}{i},$

which gives the first expression in (3.12) since $\omega(m, 1) = H_{m+1}-1$ . The second expression in (3.12) follows by another inverse pair

$H_{m+1}-1 = \sum\limits_{i = 1}^{m}\frac{(-1)^{i-1}}{i(i+1)} \binom{m}{i}\;\text{and}\;\frac{1}{m(m+1)} = \sum\limits_{i = 1}^m(-1)^{i-1} \binom{m}{i}(H_{i+1}-1).$

□

We have therefore the following four explicit formulae.

Theorem 11 ( $m, \; n\in\mathbb{{N}}_0$ ).

$\begin{align} &B_n = \sum\limits_{i = 0}^m \frac{(-1)^i}{i+1} \binom{m+1}{i+1} \sum\limits_{k = 0}^ik^n, &&{m\ge n\ge0}; \end{align}$

(3.13)

$\begin{align} &B_n = \sum\limits_{i = 1}^m \frac{(-1)^{i-1}}{i(i+1)} \binom{m}{i}\sum\limits_{k = 1}^ik^n, &&{m\ge n\ge2}; \end{align}$

(3.14)

$\begin{align} &B_n = \sum\limits_{i = 0}^m \frac{(-1)^i}{i+1} \binom{m+1}{i+1} \sum\limits_{k = 0}^{i+1}k^n, &&{m\ge n\ge2}; \end{align}$

(3.15)

$\begin{align} &B_n = (-1)^n \frac{n!\chi(m = n)}{n+1} +\sum\limits_{i = 0}^{m}\frac{(-1)^i}{i+1} \binom{m}{i+1} \sum\limits_{k = 0}^ik^n, &\quad&{m\ge n\ge0}. \end{align}$

(3.16)

In the last line, $\chi$ stands for the logical function with $\chi(\text{true}) = 1$ and $\chi(\text{false}) = 0$ . When $m = n$ , the first identity recovers Bergmann ^[7] (cf. Gould [23, Eq (5)], [, Eq (1.10)]), and the two variants (3.15) and (3.16) reduce to Gould [, Eqs (1.11) and (1.12)]. In addition, we remark that when $m > n$ , (3.15) is substantially the same as (3.13).

Proof. The first two identities follow directly by (3.11) and (3.12). In comparison with (3.13), the third identity (3.15) is equivalent to

$\sum\limits_{i = 0}^m(-1)^i \binom{m+1}{i+1}(i+1)^{n-1} = \sum\limits_{j = 1}^{m+1}(-1)^{j-1} \binom{m+1}{j}j^{n-1} = 0,$

because for $m\ge n > 1$ , the order $m+1$ of the differences is higher than the polynomial degree $n-1$ .

By means of the binomial relation

$\binom{n+1}{i+1} = \binom{n}{i+1}+ \binom{n}{i},$

we can rewrite (3.13) as

$\begin{align*} B_n = &\sum\limits_{i = 0}^{m}\frac{(-1)^i}{i+1} \binom{m}{i+1} \sum\limits_{k = 0}^ik^n +\sum\limits_{i = 0}^m\frac{(-1)^i}{i+1} \binom{m}{i} \sum\limits_{k = 0}^ik^n. \end{align*}$

Recall that the power sum $\sum_{k = 0}^{j-1}k^n$ results in a polynomial of degree $n+1$ in $j$ with the leading coefficient being equal to $\frac1{n+1}$ . We can evaluate the second sum above in closed form as follows:

$\begin{align*} \sum\limits_{i = 0}^m\frac{(-1)^i}{i+1} \binom{m}{i} \sum\limits_{k = 0}^ik^n = &\frac{(-1)^m}{m+1}\sum\limits_{j = 0}^m (-1)^{1+m-j} \binom{m+1}{j} \sum\limits_{k = 0}^{j-1}k^n\\ = &\frac{(-1)^m}{m+1}\Delta^{m+1} \frac{x^{n+1}}{n+1}\Big|_{x = 0}\\ = &(-1)^n\frac{n!}{n+1}\chi(m = n). \end{align*}$

This confirms identity (3.16) and completes the proof of Theorem 11. □

3.3. Partial fractions

Consider the partial fraction decomposition

$\frac{(x)_\ell}{(1+m+x)_{\ell+1}} = \sum\limits_{j = 0}^{\ell} \frac{(-1)^{j+\ell}}{1+m+x+j} \binom{\ell}{j} \binom{1+m+j}{\ell}.$

In the above equation, letting " $x\to-i, \; \ell\to k$ " and " $x\to1-i, \; \ell\to k-1$ ", we have, respectively, the two equalities:

$\begin{align*} &\frac{(-i)_k}{(1+m-i)_{k+1}} = \sum\limits_{j = 0}^{k} \frac{(-1)^{j+k}}{1+m-i+j} \binom{k}{j} \binom{1+m+j}{k},\\ &\frac{(1-i)_{k-1}}{(2+m-i)_{k}} = \sum\limits_{j = 1}^{k} \frac{(-1)^{j+k}}{1+m-i+j} \binom{k-1}{j-1} \binom{m+j}{k-1}. \end{align*}$

Substituting them into (3.3) and (3.6), respectively, then manipulating the double sums by exchanging the summation order, we derive the following equivalent expressions in terms of harmonic numbers.

Proposition 12 ( $m, \; k\in\mathbb{{N}}_0$ ).

$\begin{align*} & \Omega(m,k) = \sum\limits_{j = 0}^{k}(-1)^{j+k} \binom{k}{j} \binom{1+m+j}{k} \big\{H_{1+m-k+j}-H_j\big\}, &&{m\ge k\ge0};\\ & \omega(m,k) = \sum\limits_{j = 1}^{k}(-1)^{j+k} \binom{k-1}{j-1} \binom{m+j}{k-1} \big\{H_{1+m-k+j}-H_j\big\}, &\quad&{m\ge k\ge1}. \end{align*}$

Consequently, we find two further explicit formulae involving harmonic numbers.

Theorem 13 ( $m, \; n\in\mathbb{{N}}$ ).

$\begin{align*} &B_n = \sum\limits_{k = 1}^mk^n \sum\limits_{j = 0}^{k}(-1)^{j+k} \binom{k}{j} \binom{1+m+j}{k} \big\{H_{1+m-k+j}-H_j\big\}, &&{m\ge n\ge1};\\ &B_n = \sum\limits_{k = 1}^mk^n \sum\limits_{j = 1}^{k}(-1)^{j+k} \binom{k-1}{j-1} \binom{m+j}{k-1} \big\{H_{1+m-k+j}-H_j\big\}, &\quad&{m\ge n\ge2}. \end{align*}$

4. More summation formulae

We are going to review, finally in this section, more summation formulae involving harmonic numbers and Stirling numbers of the second kind by intervening with an extra integer parameter $m$ .

4.1. Harmonic numbers

There exist two formulae expressing $B_n$ in terms of harmonic numbers, that are quite different from those in Theorem 13.

Theorem 14 ( ${m > n\ge1}$ ).

$\begin{align} B_n& = \sum\limits_{i = 1}^mH_i\sum\limits_{k = 1}^i(-1)^{k-1} \binom{i-1}{k-1}k^n\\ & = \sum\limits_{k = 1}^mk^n\sum\limits_{i = k}^m(-1)^{k-1} \binom{i-1}{k-1}H_i, \end{align}$

(4.1)

$\begin{align} & \begin{aligned}B_n& = \frac{2}{n+1}\sum\limits_{i = 1}^m\frac{H_i}{i+1} \sum\limits_{k = 1}^i(-1)^{k-1} \binom{i}{k}k^{n+1}\\ & = \frac{2}{n+1}\sum\limits_{k = 1}^mk^{n+1} \sum\limits_{i = k}^m(-1)^{k-1} \binom{i}{k}\frac{H_i}{i+1}. \end{aligned} \end{align}$

(4.2)

When $m = n$ , the second formula (4.2) recovers Gould [24, Eq (1.4)].

Proof. Recalling the generating function

$\sum\limits_{i = 1}^{\infty}H_iy^i = -\frac{\ln(1-y)}{1-y},$

we can proceed with

$\begin{align*} B_n& = n![x^n]\frac{x}{e^x-1} = n![x^n]\frac{e^x}{1-e^x}\times \frac{-\ln\{1-(1-e^x)\}}{1-(1-e^x)}\\ & = n![x^n]\sum\limits_{i = 1}^mH_ie^x(1-e^x)^{i-1}\qquad\boxed{m > n}\\ & = n![x^n]\sum\limits_{i = 1}^mH_i\sum\limits_{k = 1}^i(-1)^{k-1} \binom{i-1}{k-1}e^{kx}, \end{align*}$

which results in the first formula (4.1).

The second formula (4.2) is a variant of (4.1), which can be verified by making use of another generating function

$\sum\limits_{i = 1}^{\infty}\frac{H_i}{i+1}y^{i+1} = \frac{\ln^2(1-y)}{2}.$

In fact, we can similarly extract the coefficient as follows:

$\begin{align*} B_n& = n![x^n]\frac{x}{e^x-1}\\ & = n![x^n]\frac{2\ln^2\{1-(1-e^x)\}}{2x(e^x-1)}\\ & = -2n![x^{n+1}]\sum\limits_{i = 1}^m\frac{H_i}{i+1}(1-e^x)^{i}\qquad\boxed{m > n}\\ & = -2n![x^{n+1}]\sum\limits_{i = 1}^m\frac{H_i}{i+1}\sum\limits_{k = 1}^i(-1)^k \binom{i}{k}e^{kx}\\ & = \frac{2}{n+1}\sum\limits_{i = 1}^m\frac{H_i}{i+1} \sum\limits_{k = 1}^i(-1)^{k-1} \binom{i}{k}k^{n+1}. \end{align*}$

□

4.2. Stirling numbers of the second kind

Here we offer three formulae containing the Stirling numbers of the second kind, extending those by Shirai [46, Theorem 6 and Corollary 7] (cf. Morrow [38, Eq (1.5)]).

Theorem 15 ( $\lambda\ne0$ and $m, \; n\in\mathbb{{N}}$ with ${m\ge n\ge0}$ ).

$\begin{align} B_n& = \sum\limits_{j = 0}^m(-1)^j \frac{ \binom{m+1}{j+1}}{ \binom{n+j}{j}}S_2(n+j,j), \end{align}$

(4.3)

$\begin{align} B_n& = \frac{n}{n-1}\sum\limits_{j = 1}^{m+1}(-1)^j \frac{ \binom{m+2}{j+1}}{ \binom{n+j-1}{j}}S_2(n+j,j), \end{align}$

(4.4)

$\begin{align} B_n& = \frac{n}{n-1}\sum\limits_{j = 1}^{m+2}(-1)^j \frac{ \lambda+j+1}{ \lambda} \frac{ \binom{m+3}{j+1}}{ \binom{n+j-1}{j}}S_2(n+j,j). \end{align}$

(4.5)

When $m = n$ , the first formula (4.3) can be found in Gould [23, Eq (11)], [24, Eq (1.5)] (see also Luo ^[33], Quaintance and Gould [, Eq (15.10)], Shirai [, Theorem 6]). Two variants (4.4) and (4.5) with $m = n$ and $\lambda = n+\frac23$ are due to Shirai [46, Corollary 7].

Proof. Recall the exponential generating function

$\frac{(e^x-1)^j}{j!} = \sum\limits_{n = 0}^{\infty} \frac{x^{n+j}}{(n+j)!}S_2(n+j,j).$

We can extract the coefficient

$\begin{align*} B_n& = n![x^n]\frac{x}{e^x-1} = n![x^n]\frac{1}{1-\big\{1-\frac{e^x-1}x\big\}}\\ & = n![x^n]\sum\limits_{i = 0}^m\Big\{1-\frac{e^x-1}x\Big\}^i \qquad\boxed{m\ge n}\\ & = n!\sum\limits_{i = 0}^m\sum\limits_{j = 0}^i(-1)^j \binom{i}{j}[x^{n+j}](e^x-1)^j\\ & = n!\sum\limits_{j = 0}^m(-1)^j[x^{n+j}](e^x-1)^j \sum\limits_{i = j}^m \binom{i}{j}. \end{align*}$

Evaluating the last sum

$\sum\limits_{i = j}^m \binom{i}{j} = \binom{m+1}{j+1},$

we get the expression

$\begin{align*} B_n& = n!\sum\limits_{j = 0}^m(-1)^j \binom{m+1}{j+1}[x^{n+j}](e^x-1)^j\\ & = \sum\limits_{j = 0}^m(-1)^j\frac{ \binom{m+1}{j+1}}{ \binom{n+j}{j}}S_2(n+j,j), \end{align*}$

which proves the first formula (4.3).

The second sum (4.4) can be evaluated as follows:

$\begin{align*} \sum\limits_{j = 1}^{m+1}&(-1)^j\frac{n}{n-1} \frac{ \binom{m+2}{j+1}}{ \binom{n+j-1}{j}}S_2(n+j,j)\\ = &n![x^n]\sum\limits_{j = 1}^{m+1}(-1)^j \binom{m+2}{j+1} \frac{n+j}{n-1}\Big(\frac{e^x-1}{x}\Big)^j\\ = &n![x^n]\sum\limits_{j = 1}^{m+1}(-1)^j \binom{m+2}{j+1} \Big(1+\frac{j+1}{n-1}\Big)\Big(\frac{e^x-1}{x}\Big)^j\\ = &B_n+\frac{n!(m+2)}{n-1}[x^n]\sum\limits_{j = 0}^{m+1} (-1)^j \binom{m+1}{j} \Big(\frac{e^x-1}{x}\Big)^j\\ = &B_n+\frac{n!(m+2)}{n-1}[x^n] \Big(1-\frac{e^x-1}{x}\Big)^{m+1}, \end{align*}$

because the last coefficient vanishes, thanks to the fact that $m+1 > n$ and the constant term of $\big(1-\frac{e^x-1}{x}\big)$ is equal to zero.

Finally, writing

$\frac{ \lambda+j+1}{ \lambda} = 1+\frac{j+1}{ \lambda},$

we can reformulate the third sum in (4.5) as

$\begin{align*} &\sum\limits_{j = 1}^{m+2}(-1)^j\frac{n( \lambda+j+1)}{(n-1) \lambda} \frac{ \binom{m+3}{j+1}}{ \binom{n+j-1}{j}}S_2(n+j,j)\\ = &\frac{n}{n-1}\sum\limits_{j = 1}^{m+2}(-1)^j \frac{ \binom{m+3}{j+1}}{ \binom{n+j-1}{j}}S_2(n+j,j)\\ +&\frac{n(m+3)}{(n-1) \lambda} \sum\limits_{j = 1}^{m+2}(-1)^j \frac{ \binom{m+2}{j}}{ \binom{n+j-1}{j}}S_2(n+j,j). \end{align*}$

The first term on the right equals $B_n$ in view of (4.4). The second term on the right vanishes again, which is justified analogously as follows:

$\begin{align*} &\!\sum\limits_{j = 1}^{m+2}(-1)^j \frac{ \binom{m+2}{j}} { \binom{n+j-1}{j}}S_2(n+j,j)\\ & = (n-1)!\sum\limits_{j = 1}^{m+2}(-1)^j (n+j) \binom{m+2}{j} [x^n]\Big(\frac{e^x-1}{x}\Big)^j\\ & = n(n-1)![x^n] \sum\limits_{j = 0}^{m+2}(-1)^j \binom{m+2}{j} \Big(\frac{e^x-1}{x}\Big)^j\\ &+(m+2)(n-1)![x^n] \sum\limits_{j = 1}^{m+2}(-1)^j \binom{m+1}{j-1} \Big(\frac{e^x-1}{x}\Big)^j\\ & = n(n-1)![x^n] \Big(1-\frac{e^x-1}{x}\Big)^{m+2}\\ &-(m+2)(n-1)![x^n] \Big(1-\frac{e^x-1}{x}\Big)^{m+1} \Big(\frac{e^x-1}{x}\Big). \end{align*}$

□

4.3. Two formulae of Todorov ^[48]

Theorem 16 ( ${m\ge n\ge2}$ ).

$\begin{align} B_n& = \frac{n}{2^n-1} \sum\limits_{i = 1}^m(-1)^{i-1}\frac{i!}{2^{i+1}}S_2(n-1,i) \end{align}$

(4.6)

$\begin{align} & = \frac{n}{2^n-1}\sum\limits_{k = 1}^mk^{n-1} \sum\limits_{i = k}^m\frac{(-1)^{k-1}}{2^{i+1}} \binom{i}{k},\\ B_n& = \frac{n}{2^n-1}\sum\limits_{k = 1}^mk^{n-1} \sum\limits_{i = k}^m\frac{(-1)^{k-1}}{2^{i}} \binom{i-1}{k-1}. \end{align}$

(4.7)

The special case $m = n-1$ of the first formula (4.6) was found by Worptzky ^[50] (see also Carlitz [9, Eq (6)], Garabedian ^[21], Gould [, Eq (2)], [, Eq (3.22)]). Instead, the variant (4.7) reduces, for $m = n$ , to Carlitz [9, Eq (5)].

Proof. By making use of the algebraic identity

${\mathcal{{F}}(x)} : = \bigg\{\frac{2x}{e^{2x}-1}-1\bigg\} -\bigg\{\frac{x}{e^{x}-1}-1\bigg\} = \frac{-x}{1+e^x},$

we can extract the coefficient

$\begin{align*} \frac{2^n-1}{n!}B_n & = [x^n]\mathcal{{F}}(x) = [x^n]\frac{-x}{1+e^x}\\ & = -[x^{n-1}]\frac{1}{2-(1-e^x)}\\ & = -[x^{n-1}]\sum\limits_{i = 1}^m\frac{(-1)^i}{2^{i+1}}(e^x-1)^i \quad\qquad\quad \quad\qquad\quad\boxed{1+m\ge n > 0}\\ & = \sum\limits_{i = 1}^m\frac{(-1)^{i-1}}{2^{i+1}}\frac{i!}{(n-1)!}S_2(n-1,i), \end{align*}$

which proves the first identity (4.6). Analogously, we have

$\begin{align*} \frac{2^n-1}{n!}B_n & = [x^n]\mathcal{{F}}(x) = [x^{n-1}]\frac{-1}{1+e^x}\\ & = [x^{n-1}]\bigg\{\frac{1}{2(1-\frac{1-e^x}{2})} -\frac{1}{1-\frac{1-e^x}{2}}\bigg\}\\ & = \sum\limits_{i = 1}^m \frac{(-1)^{i-1}}{2^{i}} [x^{n-1}]\Big\{(e^x-1)^i+(e^x-1)^{i-1}\Big\} \quad\boxed{m\ge n-1}\\ & = \sum\limits_{i = 1}^m\frac{(-1)^{i-1}}{2^{i}(n-1)!} \Big\{i!S_2(n-1,i)+(i-1)!S_2(n-1,i-1)\Big\}. \end{align*}$

By invoking the expression

$S_2(n,i) = \sum\limits_{j = 1}^i \frac{(-1)^{i+j}}{i!} \binom{i}{j}j^n,$

we can further manipulate the last sum

$\begin{align*} \frac{2^n-1}{n}B_n & = \sum\limits_{i = 1}^m\frac{(-1)^{k-1}}{2^{i}} \sum\limits_{k = 1}^i\Bigg\{ \binom{i}{k}- \binom{i-1}{k}\Bigg\} k^{n-1}\\ & = \sum\limits_{i = 1}^m\frac{(-1)^{k-1}}{2^{i}} \sum\limits_{k = 1}^i \binom{i-1}{k-1}k^{n-1}\\ & = \sum\limits_{i = 1}^m\frac{(-1)^{k-1}}{i2^{i}} \sum\limits_{k = 1}^i \binom{i}{k}k^{n}. \end{align*}$

This confirms the second formula (4.7). □

The formulae in Theorem 16 imply the following results, that recover, for $m = n-1$ and $m = n$ , the two formulae due to Todorov [48, Eqs (8) and (9)] (see also Gould [24, Eq (3.23)] for the former one).

Theorem 17 ( ${m\ge n\ge2}$ ).

$\begin{align} B_n& = \frac{n}{2^{m+1}(2^n-1)} \sum\limits_{j = 0}^{m}\sum\limits_{k = 0}^{j} (-1)^{k-1} \binom{m+1}{j+1} k^{n-1}, \end{align}$

(4.8)

$\begin{align} B_n& = \frac{n}{2^m(2^n-1)} \sum\limits_{j = 1}^m \sum\limits_{k = 1}^j(-1)^{k-1} \binom{m}{j}k^{n-1}. \end{align}$

(4.9)

Proof. By means of the binomial transform

$\begin{align*} \sum\limits_{i = k}^m \binom{i}{k}2^{m-i} & = \sum\limits_{i = k}^m \binom{i}{k}\sum\limits_{j = i}^m \binom{m-i}{j-i}\\ & = \sum\limits_{j = k}^m\sum\limits_{i = k}^j \binom{i}{k} \binom{m-i}{m-j}\\ & = \sum\limits_{j = k}^m \binom{m+1}{j-k}\\ & = \sum\limits_{j = k}^m \binom{m+1}{j+1}, \end{align*}$

we can reformulate the sum in (4.6) as

$\begin{align*} B_n& = \frac{n}{2^n-1} \sum\limits_{k = 0}^m(-1)^{k-1} \frac{k^{n-1}}{2^{m+1}} \sum\limits_{i = k}^m\frac{2^{m+1}}{2^{i+1}} \binom{i}{k}\\ & = \frac{n}{2^n-1} \sum\limits_{k = 0}^m(-1)^{k-1} \frac{k^{n-1}}{2^{m+1}} \sum\limits_{j = k}^m \binom{m+1}{j+1}\\ & = \frac{n}{2^{m+1}(2^n-1)} \sum\limits_{j = 0}^{m}\sum\limits_{k = 0}^{j} (-1)^{k-1} \binom{m+1}{j+1} k^{n-1}, \end{align*}$

which confirms the first identity (4.8). The second one (4.8) can be done analogously by applying another binomial transform

$\begin{align*} \sum\limits_{i = k}^m \binom{i-1}{k-1}2^{m-i} & = \sum\limits_{i = k}^m \binom{i-1}{k-1}\sum\limits_{j = i}^m \binom{m-i}{j-i}\\ & = \sum\limits_{j = k}^m\sum\limits_{i = k}^j \binom{i-1}{k-1} \binom{m-i}{m-j}\\ & = \sum\limits_{j = k}^m \binom{m}{j-k} = \sum\limits_{j = k}^m \binom{m}{j} \end{align*}$

to (4.6) and then manipulate the double sum as follows:

$\begin{align*} B_n& = \frac{n}{2^n-1}\sum\limits_{k = 1}^nk^{n} \sum\limits_{i = k}^n\frac{(-1)^{k-1}}{i2^{i}} \binom{i}{k}\\ & = \frac{n}{2^n-1}\sum\limits_{k = 1}^mk^{n-1} \frac{(-1)^{k-1}}{2^{m}} \sum\limits_{i = k}^m \binom{i-1}{k-1}2^{m-i}\\ & = \frac{n}{2^n-1}\sum\limits_{k = 1}^mk^{n-1} \frac{(-1)^{k-1}}{2^{m}} \sum\limits_{j = k}^m \binom{m}{j}\\ & = \frac{n}{2^m(2^n-1)} \sum\limits_{j = 1}^m \sum\limits_{k = 1}^j(-1)^{k-1} \binom{m}{j}k^{n-1}. \end{align*}$

□

Author contributions

Nadia Na Li: Computation, Writing, and Editing; Wenchang Chu: Original draft, Review, and Supervision. Both authors have read and agreed to the published version of the manuscript.

Acknowledgments

The authors express their sincere gratitude to the three reviewers for the careful reading, critical comments, and valuable suggestions that contributed significantly to improving the manuscript during revision.

Conflict of interest

Prof. Wenchang Chu is the Guest Editor of special issue "Combinatorial Analysis and Mathematical Constants" for AIMS Mathematics. Prof. Wenchang Chu was not involved in the editorial review and the decision to publish this article. The authors declare no conflicts of interest.

Acknowledgments

The authors extend their appreciation to the Deputyship for Research & Innovation, Ministry of Education in Saudi Arabia for funding this research work through project number 1089.

Conflict of interests

All authors declare no conflicts of interest in this paper.

References

[1]	Wang G, Zhao G, Chao X, et al. (2020) The characteristic of virulence, biofilm and antibiotic resistance of Klebsiella pneumoniae. Int J Environ Res Public Health 17: 6278. https://doi.org/10.3390/ijerph17176278
[2]	Martin RM, Bachman MA (2018) Colonization, infection, and the accessory genome of Klebsiella pneumoniae. Front Cell Infect Microbiol 8. https://doi.org/10.3389/fcimb.2018.00004
[3]	Remya PA, Shanthi M, Sekar U (2019) Characterisation of virulence genes associated with pathogenicity in Klebsiella pneumoniae. Indian J Med Microbiol 37: 210-218. https://doi.org/10.4103/ijmm.IJMM_19_157
[4]	Russo TA, Olson R, Fang CT, et al. (2018) Identification of biomarkers for differentiation of hypervirulent Klebsiella pneumoniae from classical K. pneumoniae. J Clin Microbiol 56. https://doi.org/10.1128/JCM.00776-18
[5]	Maurya N, Jangra M, Tambat R, et al. (2019) Alliance of efflux pumps with beta-Lactamases in multidrug-resistant Klebsiella pneumoniae isolates. Microb Drug Resist 25: 1155-1163. https://doi.org/10.1089/mdr.2018.0414
[6]	Pitout JD, Nordmann P, Poirel L (2015) Carbapenemase-producing Klebsiella pneumoniae, a key pathogen set for global nosocomial dominance. Antimicrob Agents Chemother 59: 5873-5884. https://doi.org/10.1128/AAC.01019-15
[7]	Iyer R, Moussa SH, Tommasi R, et al. (2019) Role of the Klebsiella pneumoniae TolC porin in antibiotic efflux. Res Microbiol 170: 112-116. https://doi.org/10.1016/j.resmic.2018.11.003
[8]	Logan LK, Weinstein RA (2017) The epidemiology of carbapenem-resistant Enterobacteriaceae: the impact and evolution of a global menace. J Infect Dis 215: S28-S36. https://doi.org/10.1093/infdis/jiw282
[9]	Kumar S, Chaudhary M, Yadav M, et al. (2020) Global surveillance programs on antimicrobial resistance. Sustainable Agr Rev 46: 33-58. https://doi.org/10.1007/978-3-030-53024-2_2
[10]	Genovese C, La Fauci V, D'Amato S, et al. (2020) Molecular epidemiology of antimicrobial resistant microorganisms in the 21th century: a review of the literature. Acta Biomed 91: 256-273. https://doi.org/10.23750/abm.v91i2.9176
[11]	Diancourt L, Passet V, Verhoef J, et al. (2005) Multilocus sequence typing of Klebsiella pneumoniae nosocomial isolates. J Clin Microbiol 43: 4178-82. https://doi.org/10.1128/JCM.43.8.4178-4182.2005
[12]	Gaibani P, Ambretti S, Tamburini MV, et al. (2018) Clinical application of Bruker Biotyper MALDI-TOF/MS system for real-time identification of KPC production in Klebsiella pneumoniae clinical isolates. J Glob Antimicrob Resist 12: 169-170. https://doi.org/10.1016/j.jgar.2018.01.016
[13]	Wang Q, Li B, Tsang AK, et al. (2013) Genotypic analysis of Klebsiella pneumoniae isolates in a Beijing hospital reveals high genetic diversity and clonal population structure of drug-resistant isolates. PLoS One 8: e57091. https://doi.org/10.1371/journal.pone.0057091
[14]	Boom R, Sol CJ, Salimans MM, et al. (1990) Rapid and simple method for purification of nucleic acids. J Clin Microbiol 28: 495-503. https://doi.org/10.1128/jcm.28.3.495-503.1990
[15]	Liu Y, Liu C, Zheng W, et al. (2008) PCR detection of Klebsiella pneumoniae in infant formula based on 16S-23S internal transcribed spacer. Int J Food Microbiol 125: 230-235. https://doi.org/10.1016/j.ijfoodmicro.2008.03.005
[16]	Singh G, Biswal M, Hallur V, et al. (2015) Utility of whole-cell repetitive extragenic palindromic sequence-based PCR (REP-PCR) for the rapid detection of nosocomial outbreaks of multidrug resistant organisms: experience at a tertiary care center in North India. Indian J Med Microbiol 33: 221-224. https://doi.org/10.4103/0255-0857.154857
[17]	Ghalavand Z, Heidary Rouchi A, Bahraminasab H, et al. (2018) Molecular testing of Klebsiella pneumoniae contaminating tissue allografts recovered from deceased donors. Cell Tissue Bank 19: 391-398. https://doi.org/10.1007/s10561-018-9684-3
[18]	Hou XH, Song XY, Ma XB, et al. (2015) Molecular characterization of multidrug-resistant Klebsiella pneumoniae isolates. Braz J Microbiol 46: 759-768. https://doi.org/10.1590/S1517-838246320140138
[19]	Gao Y, Zhang L, Li MC, et al. (2010) Molecular typing of Klebsiella pneumonia by pulse-field gel electrophoresis in combination with multilocus sequence typing. Zhonghua Liu Xing Bing Xue Za Zhi 31: 786-790.
[20]	Han H, Zhou H, Li H, et al. (2013) Optimization of pulse-field gel electrophoresis for subtyping of Klebsiella pneumoniae. Int J Environ Res Public Health 10: 2720-2731. https://doi.org/10.3390/ijerph10072720
[21]	Zakaria AM, Hassuna NA (2019) Modified PFGE protocol for improving typeability of DNA degradation susceptible nosocomial Klebsiella pneumoniae. J Med Microbiol 68: 1787-1792. https://doi.org/10.1099/jmm.0.001093
[22]	Cheng F, Li Z, Lan S, et al. (2018) Characterization of Klebsiella pneumoniae associated with cattle infections in southwest China using multi-locus sequence typing (MLST), antibiotic resistance and virulence-associated gene profile analysis. Braz J Microbiol 49: 93-100. https://doi.org/10.1016/j.bjm.2018.06.004
[23]	Liu S, Wang X, Ge J, et al. (2021) Analysis of carbapenemase-resistant genotypes of highly virulent Klebsiella pneumoniae and clinical infection characteristics of different MLST types. Evid Based Complement Alternat Med 2021: 3455121. https://doi.org/10.1155/2021/3455121
[24]	Gona F, Comandatore F, Battaglia S, et al. (2020) Comparison of core-genome MLST, coreSNP and PFGE methods for Klebsiella pneumoniae cluster analysis. Microb Genom 6. https://doi.org/10.1099/mgen.0.000347
[25]	Snitkin ES, Zelazny AM, Thomas PJ, et al. (2012) Tracking a hospital outbreak of carbapenem-resistant Klebsiella pneumoniae with whole-genome sequencing. Sci Transl Med 4: 148ra116. https://doi.org/10.1126/scitranslmed.3004129
[26]	Founou RC, Founou LL, Allam M, et al. (2019) Whole genome sequencing of extended spectrum beta-lactamase (ESBL)-producing Klebsiella pneumoniae isolated from hospitalized patients in KwaZulu-Natal, South Africa. Sci Rep 9: 6266. https://doi.org/10.1038/s41598-019-42672-2
[27]	Nutman A, Marchaim D (2019) How to: molecular investigation of a hospital outbreak. Clin Microbiol Infect 25: 688-695. https://doi.org/10.1016/j.cmi.2018.09.017
[28]	Ahmad S, Abulhamd A (2015) Phenotypic and molecular characterization of nosocomial K. pneumoniae isolates by ribotyping. Adv Med Sci 60: 69-75. https://doi.org/10.1016/j.advms.2014.10.003
[29]	Schumann P, Pukall R (2013) The discriminatory power of ribotyping as automatable technique for differentiation of bacteria. Syst Appl Microbiol 36: 369-375. https://doi.org/10.1016/j.syapm.2013.05.003
[30]	Manchanda V, Singh NP, Shamweel A, et al. (2006) Molecular epidemiology of clinical isolates of ampc producing Klebsiella pneumoniae. Indian J Med Microbiol 24: 177-181.
[31]	Aboulela A, El-Sherbini E, Abu-Sheasha G, et al. (2020) Molecular strain typing of multidrug-resistant Klebsiella pneumoniae: capsular wzi gene sequencing versus multiple locus variable number tandem repeat analysis. Diagn Microbiol Infect Dis 98: 115139. https://doi.org/10.1016/j.diagmicrobio.2020.115139
[32]	Carattoli A, Bertini A, Villa L, et al. (2005) Identification of plasmids by PCR-based replicon typing. J Microbiol Methods 63: 219-228. https://doi.org/10.1016/j.mimet.2005.03.018
[33]	Shankar C, Muthuirulandi Sethuvel DP, Neeravi AR, et al. (2020) Identification of plasmids by PCR based replicon typing in bacteremic Klebsiella pneumoniae. Microb Pathog 148: 104429. https://doi.org/10.1016/j.micpath.2020.104429
[34]	Johnson TJ, Nolan LK (2009) Plasmid replicon typing. Methods Mol Biol 551: 27-35. https://doi.org/10.1007/978-1-60327-999-4_3
[35]	Nielsen JB, Skov MN, Jorgensen RL, et al. (2011) Identification of CTX-M15-, SHV-28-producing Klebsiella pneumoniae ST15 as an epidemic clone in the Copenhagen area using a semi-automated Rep-PCR typing assay. Eur J Clin Microbiol Infect Dis 30: 773-778. https://doi.org/10.1007/s10096-011-1153-x
[36]	Genc S, Kolayli F, Ozcelik EY (2021) Molecular characterization of carbapenemase producing Klebsiella pneumoniae strains by multiplex PCR and PFGE methods: the first K.pneumoniae isolates co-producing OXA-48/KPC and KPC/NDM in Turkey. J Infect Chemother 28: 192-198. https://doi.org/10.1016/j.jiac.2021.10.009
[37]	Wu B, Wang Y, Ling Z, et al. (2020) Heterogeneity and diversity of mcr-8 genetic context in chicken-associated Klebsiella pneumoniae. Antimicrob Agents Chemother 65. https://doi.org/10.1128/AAC.01872-20
[38]	Indrajith S, Mukhopadhyay AK, Chowdhury G, et al. (2021) Molecular insights of carbapenem resistance Klebsiella pneumoniae isolates with focus on multidrug resistance from clinical samples. J Infect Public Health 14: 131-138. https://doi.org/10.1016/j.jiph.2020.09.018
[39]	Lopes E, Saavedra MJ, Costa E, et al. (2020) Epidemiology of carbapenemase-producing Klebsiella pneumoniae in northern Portugal: Predominance of KPC-2 and OXA-48. J Glob Antimicrob Resist 22: 349-353. https://doi.org/10.1016/j.jgar.2020.04.007
[40]	Szymankiewicz M, Nowikiewicz T, Stefaniuk E, et al. (2021) Characteristics of ESBL-producing enterobacterales colonizing the gastrointestinal tract in patients admitted to the oncological hospital. Curr Microbiol 78: 642-648. https://doi.org/10.1007/s00284-020-02334-3
[41]	Tot T, Kibel S, Sardelic S, et al. (2021) Polyclonal spread of colistin resistant Klebsiella pneumoniae in Croatian hospitals and outpatient setting. Germs 11: 163-178. https://doi.org/10.18683/germs.2021.1254
[42]	Kumar S, Patil PP, Singhal L, et al. (2019) Molecular epidemiology of carbapenem-resistant Acinetobacter baumannii isolates reveals the emergence of blaOXA-23 and blaNDM-1 encoding international clones in India. Infect Genet Evol 75: 103986. https://doi.org/10.1016/j.meegid.2019.103986
[43]	Chen CM, Wang M, Li XP, et al. (2021) Homology analysis between clinically isolated extraintestinal and enteral Klebsiella pneumoniae among neonates. BMC Microbiol 21: 25. https://doi.org/10.1186/s12866-020-02073-2
[44]	Shankar C, Jacob JJ, Sugumar SG, et al. (2021) Distinctive mobile genetic elements observed in the clonal expansion of carbapenem-resistant Klebsiella pneumoniae in India. Microb Drug Resist 27: 1096-1104. https://doi.org/10.1089/mdr.2020.0316
[45]	Banerjee T, Wangkheimayum J, Sharma S, et al. (2021) Extensively drug-resistant hypervirulent Klebsiella pneumoniae from a series of neonatal sepsis in a tertiary care hospital, India. Front Med (Lausanne) 8: 645955. https://doi.org/10.3389/fmed.2021.645955
[46]	Wang CH, Ma L, Huang LY, et al. (2021) Molecular epidemiology and resistance patterns of blaOXA-48 Klebsiella pneumoniae and Escherichia coli: a nationwide multicenter study in Taiwan. J Microbiol Immunol Infect 54: 665-672. https://doi.org/10.1016/j.jmii.2020.04.006
[47]	Silva-Sanchez J, Barrios-Camacho H, Hernandez-Rodriguez E, et al. (2021) Molecular characterization of KPC-2-producing Klebsiella pneumoniae ST258 isolated from bovine mastitis. Braz J Microbiol 52: 1029-1036. https://doi.org/10.1007/s42770-021-00445-y
[48]	Zhao W, Li S, Schwarz S, et al. (2021) Detection of a NDM-5-producing Klebsiella pneumoniae sequence type 340 (CG258) high-risk clone in swine. Vet Microbiol 262: 109218. https://doi.org/10.1016/j.vetmic.2021.109218
[49]	Brahmia S, Lalaoui R, Nedjai S, et al. (2021) First clinical cases of KPC-2-Producing Klebsiella pneumoniae ST258 in Algeria and outbreak of Klebsiella pneumoniae ST101 harboring blaOXA-48 gene in the urology department of Annaba Hospital. Microb Drug Resist 27: 652-659. https://doi.org/10.1089/mdr.2020.0080
[50]	Kumar S, Anwer R, Yadav M, et al. (2021) Molecular typing and global epidemiology of Staphylococcus aureus. Curr Pharmacol Rep 7: 179-186. https://doi.org/10.1007/s40495-021-00264-7
[51]	Kumar S, Saifi Z, Sharma A, et al. (2020) Rapid identification of clinical isolates of Klebsiella pneumoniae using MALDI-TOF MS from North India. Bull Pure Appl Sci (Zoology) 39: 194-199. https://doi.org/10.5958/2320-3188.2020.00022.4
[52]	Gautam V, Sharma M, Singhal L, et al. (2017) MALDI-TOF mass spectrometry: an emerging tool for unequivocal identification of non-fermenting Gram-negative bacilli. Indian J Med Res 145: 665-672. https://doi.org/10.4103/ijmr.IJMR_1105_15
[53]	Kumar S, Anwer R, Sehrawat A, et al. (2021) Assessment of bacterial pathogens in drinking water: a serious safety concern. Curr Pharmacol Rep 7: 206-212. https://doi.org/10.1007/s40495-021-00263-8
[54]	Kumar S, Anwer R, Yadav M, et al. (2021) MALDI-TOF MS and molecular methods for identifying multidrug resistant clinical isolates of Acinetobacter baumannii. Res J Biotechnol 16: 47-52.
[55]	Pena I, Pena-Vina E, Rodriguez-Avial I, et al. (2022) Comparison of performance of MALDI-TOF MS and MLST for biotyping carbapenemase-producing Klebsiella pneumoniae sequence types ST11 and ST101 isolates. Enferm Infecc Microbiol Clin (Engl Ed) 40: 172-178. https://doi.org/10.1016/j.eimc.2020.10.018
[56]	Asencio-Egea MA, Gaitan-Pitera J, Huertas-Vaquero M, et al. (2021) Interhospital dissemination of KPC-3 producing-Klebsiella pneumoniae ST512. Detection by MALDI-TOF. Enferm Infecc Microbiol Clin (Engl Ed) 39: 83-86. https://doi.org/10.1016/j.eimc.2019.12.014
[57]	Huang Y, Li J, Wang Q, et al. (2021) Rapid detection of KPC-producing Klebsiella pneumoniae in China based on MALDI-TOF MS. J Microbiol Methods 192: 106385. https://doi.org/10.1016/j.mimet.2021.106385
[58]	Bridel S, Watts SC, Judd LM, et al. (2021) Klebsiella MALDI TypeR: a web-based tool for Klebsiella identification based on MALDI-TOF mass spectrometry. Res Microbiol 172: 103835. https://doi.org/10.1016/j.resmic.2021.103835
[59]	Meng X, Yang J, Duan J, et al. (2019) Assessing molecular epidemiology of carbapenem-resistant Klebsiella pneumoniae (CR-KP) with MLST and MALDI-TOF in Central China. Sci Rep 9: 2271. https://doi.org/10.1038/s41598-018-38295-8
[60]	Purighalla S, Esakimuthu S, Reddy M, et al. (2017) Discriminatory power of three typing techniques in determining relatedness of nosocomial Klebsiella pneumoniae isolates from a tertiary hospital in India. Indian J Med Microbiol 35: 361-368. https://doi.org/10.4103/ijmm.IJMM_16_308
[61]	Elbehiry A, Marzouk E, Hamada M, et al. (2017) Application of MALDI-TOF MS fingerprinting as a quick tool for identification and clustering of foodborne pathogens isolated from food products. New Microbiol 40: 269-278.
[62]	Anwer R, Darami H, Almarri FK, et al. (2022) MALDI-TOF MS for rapid analysis of bacterial pathogens causing urinary tract infections in the Riyadh region. Diseases 10: 78. https://doi.org/10.3390/diseases10040078
[63]	Kumar S, Patil PP, Midha S, et al. (2015) Genome sequence of Acinetobacter baumannii Strain 5021_13, isolated from cerebrospinal fluid. Genome Announc 3. https://doi.org/10.1128/genomeA.01213-15
[64]	Kumar S, Patil PP, Midha S, et al. (2015) Genome sequence of Acinetobacter baumannii Strain 10441_14 belonging to ST451, isolated from India. Genome Announc 3. https://doi.org/10.1128/genomeA.01322-15
[65]	Ben-Chetrit E, Mc Gann P, Maybank R, et al. (2021) Colistin-resistant Klebsiella pneumoniae bloodstream infection: old drug, bad bug. Arch Microbiol 203: 2999-3006. https://doi.org/10.1007/s00203-021-02289-4
[66]	Sherif M, Palmieri M, Mirande C, et al. (2021) Whole-genome sequencing of Egyptian multidrug-resistant Klebsiella pneumoniae isolates: a multi-center pilot study. Eur J Clin Microbiol Infect Dis 40: 1451-1460. https://doi.org/10.1007/s10096-021-04177-7
[67]	Gentile B, Grottola A, Orlando G, et al. (2020) A retrospective whole-genome sequencing analysis of carbapenem and colistin-resistant Klebsiella Pneumoniae nosocomial strains isolated during an MDR surveillance program. Antibiotics (Basel) 9: 246. https://doi.org/10.3390/antibiotics9050246
[68]	Saavedra SY, Bernal JF, Montilla-Escudero E, et al. (2021) Complexity of genomic epidemiology of carbapenem-resistant Klebsiella pneumoniae isolates in Colombia urges the reinforcement of whole genome sequencing-based surveillance programs. Clin Infect Dis 73: S290-S299. https://doi.org/10.1093/cid/ciab777
[69]	Fu P, Tang Y, Li G, et al. (2019) Pandemic spread of blaKPC-2 among Klebsiella pneumoniae ST11 in China is associated with horizontal transfer mediated by IncFII-like plasmids. Int J Antimicrob Agents 54: 117-124. https://doi.org/10.1016/j.ijantimicag.2019.03.014
[70]	Yan Z, Zhou Y, Du M, et al. (2019) Prospective investigation of carbapenem-resistant Klebsiella pneumonia transmission among the staff, environment and patients in five major intensive care units, Beijing. J Hosp Infect 101: 150-157. https://doi.org/10.1016/j.jhin.2018.11.019
[71]	Hu Y, Zhou H, Lu J, et al. (2021) Evaluation of the IR Biotyper for Klebsiella pneumoniae typing and its potentials in hospital hygiene management. Microb Biotechnol 14: 1343-1352. https://doi.org/10.1111/1751-7915.13709
[72]	Kumar S, Anwer R, Yadav M, et al. (2022) An update on advancements in treatment options for managing Klebsiella pneumoniae infections. Curr Pharmacol Rep 8: 439-449. https://doi.org/10.1007/s40495-022-00302-y
[73]	Bernardini A, Cuesta T, Tomas A, et al. (2019) The intrinsic resistome of Klebsiella pneumoniae. Int J Antimicrob Agents 53: 29-33. https://doi.org/10.1016/j.ijantimicag.2018.09.012
[74]	Wattal C, Goel N, Oberoi JK, et al. (2010) Surveillance of multidrug resistant organisms in tertiary care hospital in Delhi, India. J Assoc Physicians India 58: 32-36.
[75]	Codjoe FS, Donkor ES (2017) Carbapenem resistance: a review. Med Sci (Basel) 6. https://doi.org/10.3390/medsci6010001
[76]	Kumar S, Anwer R, Azzi A (2021) Virulence potential and treatment options of multidrug-resistant (MDR) Acinetobacter baumannii. Microorganisms 9. https://doi.org/10.3390/microorganisms9102104
[77]	AlQumaizi KI, Kumar S, Anwer R, et al. (2022) Differential gene expression of efflux pumps and porins in clinical isolates of MDR Acinetobacter baumannii. Life (Basel) 12. https://doi.org/10.3390/life12030419
[78]	Gautam V, Kumar S, Patil PP, et al. (2020) Exploring the interplay of resistance nodulation division efflux pumps, Ampc and Oprd in antimicrobial resistance of Burkholderia cepacia complex in clinical isolates. Microb Drug Resist 26: 1144-1152. https://doi.org/10.1089/mdr.2019.0102
[79]	Kumar S, Singhal L, Ray P, et al. (2020) Over-expression of RND and MATE efflux pumps contribute to decreased susceptibility in clinical isolates of carbapenem resistant Acinetobacter baumannii. Int J Pharm Res 12: 342-349.
[80]	Turkel I, Yildirim T, Yazgan B, et al. (2017) Relationship between antibiotic resistance, efflux pumps, and biofilm formation in extended-spectrum beta-lactamase producing Klebsiella pneumoniae. J Chemother 30: 354-363. https://doi.org/10.1080/1120009X.2018.1521773
[81]	Schaenzer AJ, Wright GD (2020) Antibiotic resistance by enzymatic modification of antibiotic targets. Trends Mol Med 26: 768-782. https://doi.org/10.1016/j.molmed.2020.05.001
[82]	McDanel J, Schweizer M, Crabb V, et al. (2017) Incidence of extended-spectrum beta-lactamase (ESBL)-Producing Escherichia coli and Klebsiella infections in the United States: a systematic literature review. Infect Control Hosp Epidemiol 38: 1209-1215. https://doi.org/10.1017/ice.2017.156
[83]	Pulzova L, Navratilova L, Comor L (2017) Alterations in outer membrane permeability favor drug-resistant phenotype of Klebsiella pneumoniae. Microb Drug Resist 23: 413-420. https://doi.org/10.1089/mdr.2016.0017
[84]	Lv F, Cai J, He Q, et al. (2021) Overexpression of efflux pumps mediate pan resistance of Klebsiella pneumoniae Sequence Type 11. Microb Drug Resist 27: 1405-1411. https://doi.org/10.1089/mdr.2020.0395
[85]	Gao H, Liu Y, Wang R, et al. (2020) The transferability and evolution of NDM-1 and KPC-2 co-producing Klebsiella pneumoniae from clinical settings. EBioMedicine 51: 102599. https://doi.org/10.1016/j.ebiom.2019.102599
[86]	Tsioutis C, Eichel VM, Mutters NT (2021) Transmission of Klebsiella pneumoniae carbapenemase (KPC)-producing Klebsiella pneumoniae: the role of infection control. J Antimicrob Chemother 76: i4-i11. https://doi.org/10.1093/jac/dkaa492
[87]	Shields RK, Chen L, Cheng S, et al. (2017) Emergence of ceftazidime-avibactam resistance due to plasmid-borne blaKPC-3 mutations during treatment of carbapenem-resistant Klebsiella pneumoniae infections. Antimicrob Agents Chemother 61. https://doi.org/10.1128/AAC.02097-16
[88]	Shankar C, Karunasree S, Manesh A, et al. (2019) First report of whole-genome sequence of colistin-resistant Klebsiella quasipneumoniae subsp. similipneumoniae Producing KPC-9 in India. Microb Drug Resist 25: 489-493. https://doi.org/10.1089/mdr.2018.0116
[89]	Yang Y, Ahmed M, Qin M, et al. (2022) Carriage of distinct blaKPC-2 and blaOXA-48 plasmids in a single ST11 hypervirulent Klebsiella pneumoniae isolate in Egypt. BMC Genomics 23: 20. https://doi.org/10.1186/s12864-021-08214-9
[90]	Paul M (2021) Management of KPC-producing Klebsiella pneumoniae in clinical practice: introduction. J Antimicrob Chemother 76: i2-i3. https://doi.org/10.1093/jac/dkaa491
[91]	Cano A, Gutierrez-Gutierrez B, Machuca I, et al. (2018) Risks of infection and mortality among patients colonized with Klebsiella pneumoniae carbapenemase-producing K. pneumoniae: validation of scores and proposal for management. Clin Infect Dis 66: 1204-1210. https://doi.org/10.1093/cid/cix991
[92]	Bedenic B, Sardelic S, Luxner J, et al. (2016) Molecular characterization of class b carbapenemases in advanced stage of dissemination and emergence of class d carbapenemases in Enterobacteriaceae from Croatia. Infect Genet Evol 43: 74-82. https://doi.org/10.1016/j.meegid.2016.05.011
[93]	Al-Agamy MH, Aljallal A, Radwan HH, et al. (2018) Characterization of carbapenemases, ESBLs, and plasmid-mediated quinolone determinants in carbapenem-insensitive Escherichia coli and Klebsiella pneumoniae in Riyadh hospitals. J Infect Public Health 11: 64-68. https://doi.org/10.1016/j.jiph.2017.03.010
[94]	Amarsy R, Jacquier H, Munier AL, et al. (2021) Outbreak of NDM-1-producing Klebsiella pneumoniae in the intensive care unit during the COVID-19 pandemic: another nightmare. Am J Infect Control 49: 1324-1326. https://doi.org/10.1016/j.ajic.2021.07.004
[95]	Han R, Shi Q, Wu S, et al. (2020) Dissemination of carbapenemases (KPC, NDM, OXA-48, IMP, and VIM) among carbapenem-resistant Enterobacteriaceae isolated from adult and children patients in China. Front Cell Infect Microbiol 10. https://doi.org/10.3389/fcimb.2020.00314
[96]	Bayoumi MA, Hamid OM (2022) The emergence of carbapenem resistant Enterobacteriaceae producing GIM-1 and SIM-1 clinical isolates in Khartoum-Sudan. Infect Drug Resist 15: 2679-2684. https://doi.org/10.2147/IDR.S365983
[97]	Poirel L, Castanheira M, Carrer A, et al. (2011) OXA-163, an OXA-48-related class D beta-lactamase with extended activity toward expanded-spectrum cephalosporins. Antimicrob Agents Chemother 55: 2546-2551. https://doi.org/10.1128/AAC.00022-11
[98]	Ma L, Wang JT, Wu TL, et al. (2015) Emergence of OXA-48-Producing Klebsiella pneumoniae in Taiwan. PLoS One 10: e0139152. https://doi.org/10.1371/journal.pone.0139152
[99]	Ortiz-Padilla M, Portillo-Calderon I, de Gregorio-Iaria B, et al. (2021) Interplay among different fosfomycin resistance mechanisms in Klebsiella pneumoniae. Antimicrob Agents Chemother 65. https://doi.org/10.1128/AAC.01911-20
[100]	Ito R, Mustapha MM, Tomich AD, et al. (2017) Widespread fosfomycin resistance in Gram-negative bacteria attributable to the chromosomal fosA gene. mBio 8. https://doi.org/10.1128/mBio.00749-17
[101]	Li Y, Zheng B, Zhu S, et al. (2015) Antimicrobial susceptibility and molecular mechanisms of fosfomycin resistance in clinical Escherichia coli isolates in Mainland China. PLoS One 10: e0135269. https://doi.org/10.1371/journal.pone.0135269
[102]	Castaneda-Garcia A, Blazquez J, Rodriguez-Rojas A (2013) Molecular mechanisms and clinical impact of acquired and intrinsic fosfomycin resistance. Antibiotics (Basel) 2: 217-236. https://doi.org/10.3390/antibiotics2020217
[103]	Nigiz S, Hazirolan G, Koseoglu Eser O, et al. (2021) First detection of Klebsiella pneumoniae isolate co-harboring fosfomycin resistance gene fosA3 and blactx-m among Gram negative urine isolates in a Turkish hospital. Microb Drug Resist 28. https://doi.org/10.1089/mdr.2021.0114
[104]	Kashefieh M, Hosainzadegan H, Baghbanijavid S, et al. (2021) The molecular epidemiology of resistance to antibiotics among Klebsiella pneumoniae isolates in Azerbaijan, Iran. J Trop Med 2021. https://doi.org/10.1155/2021/9195184
[105]	Baghbanijavid S, Kafil HS, Farajniya S, et al. (2021) The association of the phylogenetic typing of the Klebsiella pneumoniae isolates with antibiotic resistance. Emerg Med Int 2021. https://doi.org/10.1155/2021/1316992
[106]	Liu P, Chen S, Wu ZY, et al. (2020) Mechanisms of fosfomycin resistance in clinical isolates of carbapenem-resistant Klebsiella pneumoniae. J Glob Antimicrob Resist 22: 238-243. https://doi.org/10.1016/j.jgar.2019.12.019
[107]	Farfour E, Degand N, Riverain E, et al. (2020) Fosfomycin, from susceptibility to resistance: impact of the new guidelines on breakpoints. Med Mal Infect 50: 611-616. https://doi.org/10.1016/j.medmal.2020.07.003
[108]	Liu Y, Lin Y, Wang Z, et al. (2021) Molecular mechanisms of colistin resistance in Klebsiella pneumoniae in a tertiary care teaching hospital. Front Cell Infect Microbiol 11: 673503. https://doi.org/10.3389/fcimb.2021.673503
[109]	Jaidane N, Bonnin RA, Mansour W, et al. (2018) Genomic insights into colistin-resistant Klebsiella pneumoniae from a Tunisian teaching hospital. Antimicrob Agents Chemother 62. https://doi.org/10.1128/AAC.01601-17
[110]	Cannatelli A, Giani T, D'Andrea MM, et al. (2014) MgrB inactivation is a common mechanism of colistin resistance in KPC-producing Klebsiella pneumoniae of clinical origin. Antimicrob Agents Chemother 58: 5696-5703. https://doi.org/10.1128/AAC.03110-14
[111]	Mmatli M, Mbelle NM, Maningi NE, et al. (2020) Emerging transcriptional and genomic mechanisms mediating carbapenem and polymyxin resistance in Enterobacteriaceae: a systematic review of current reports. mSystems 5. https://doi.org/10.1128/mSystems.00783-20
[112]	Poirel L, Jayol A, Nordmann P (2017) Polymyxins: antibacterial activity, susceptibility testing, and resistance mechanisms encoded by plasmids or chromosomes. Clin Microbiol Rev 30: 557-596. https://doi.org/10.1128/CMR.00064-16
[113]	Liu YY, Wang Y, Walsh TR, et al. (2016) Emergence of plasmid-mediated colistin resistance mechanism MCR-1 in animals and human beings in China: a microbiological and molecular biological study. Lancet Infect Dis 16: 161-168. https://doi.org/10.1016/S1473-3099(15)00424-7
[114]	Li B, Yin F, Zhao X, et al. (2019) Colistin resistance gene mcr-1 mediates cell permeability and resistance to hydrophobic antibiotics. Front Microbiol 10: 3015. https://doi.org/10.3389/fmicb.2019.03015
[115]	Palucha A, Mikiewicz B, Hryniewicz W, et al. (1999) Concurrent outbreaks of extended-spectrum beta-lactamase-producing organisms of the family Enterobacteriaceae in a Warsaw hospital. J Antimicrob Chemother 44: 489-499.
[116]	Paterson DL, Ko WC, Von Gottberg A, et al. (2001) Outcome of cephalosporin treatment for serious infections due to apparently susceptible organisms producing extended-spectrum beta-lactamases: implications for the clinical microbiology laboratory. J Clin Microbiol 39: 2206-2212.
[117]	Bauernfeind A, Chong Y, Schweighart S (1989) Extended broad spectrum beta-lactamase in Klebsiella pneumoniae including resistance to cephamycins. Infection 17: 316-321.
[118]	Tangden T, Cars O, Melhus A, et al. (2010) Foreign travel is a major risk factor for colonization with Escherichia coli producing CTX-M-type extended-spectrum beta-lactamases: a prospective study with Swedish volunteers. Antimicrob Agents Chemother 54: 3564-3568. https://doi.org/10.1128/AAC.00220-10
[119]	Ur Rahman S, Ali T, Ali I, et al. (2018) The growing genetic and functional diversity of extended Spectrum Beta-lactamases. Biomed Res Int 2018: 9519718. https://doi.org/10.1155/2018/9519718
[120]	Paterson DL, Bonomo RA (2005) Extended-spectrum beta-lactamases: a clinical update. Clin Microbiol Rev 18: 657-686. https://doi.org/10.1128/CMR.18.4.657-686.2005

This article has been cited by:

Aimin Xu, Some identities connecting Stirling numbers, central factorial numbers and higher-order Bernoulli polynomials, 2025, 10, 2473-6988, 3197, 10.3934/math.2025148

Reader Comments

Your name:*

Email:*
© 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)

通讯作者: 陈斌, bchen63@163.com

1.
沈阳化工大学材料科学与工程学院沈阳 110142

AIMS Microbiology

2.7 7.0

Metrics

Article views(3561) PDF downloads(194) Cited by(12)

Preview PDF

Download XML

Export Citation

Article outline

Show full outline

AIMS Microbiology

Molecular typing methods & resistance mechanisms of MDR Klebsiella pneumoniae

Related Papers:

Abstract

1. Introduction and motivation

2. Double sum representations

2.1. Connection coefficients Ω(m,k) \Omega(m, k)

2.2. Formulae of Fekih-Ahmed [20]

2.3. Four variants with k k being shifted

3. Further explicit expressions

3.1. A binomial sum identity

3.2. Connection coefficients ω(m,k) \omega(m, k)

3.3. Partial fractions

4. More summation formulae

4.1. Harmonic numbers

4.2. Stirling numbers of the second kind

4.3. Two formulae of Todorov [48]

Author contributions

Acknowledgments

Conflict of interest

References

This article has been cited by:

Reader Comments

通讯作者: 陈斌, bchen63@163.com

Metrics

Other Articles By Authors

Related pages

Tools

Export File

Citation

Format

Content

Catalog

Abstract

1. Introduction and motivation

2. Double sum representations

2.1. Connection coefficients Ω(m,k) \Omega(m, k)

2.2. Formulae of Fekih-Ahmed [20]

2.3. Four variants with k k being shifted

3. Further explicit expressions

3.1. A binomial sum identity

3.2. Connection coefficients ω(m,k) \omega(m, k)

3.3. Partial fractions

4. More summation formulae

4.1. Harmonic numbers

4.2. Stirling numbers of the second kind

4.3. Two formulae of Todorov [48]

Author contributions

Acknowledgments

Conflict of interest

References

2.1. Connection coefficients $\Omega(m, k)$

2.2. Formulae of Fekih-Ahmed ^[20]

2.3. Four variants with $k$ being shifted

3.2. Connection coefficients $\omega(m, k)$

4.3. Two formulae of Todorov ^[48]

2.1. Connection coefficients $\Omega(m, k)$

2.2. Formulae of Fekih-Ahmed ^[20]

2.3. Four variants with $k$ being shifted

3.2. Connection coefficients $\omega(m, k)$

4.3. Two formulae of Todorov ^[48]