<html><head><meta name="color-scheme" content="light dark"></head><body><pre style="word-wrap: break-word; white-space: pre-wrap;">\documentclass[12pt,reqno]{article}

\usepackage[usenames]{color}
\usepackage{amssymb}
\usepackage{graphicx}
\usepackage{amscd}

\usepackage[colorlinks=true,
linkcolor=webgreen,
filecolor=webbrown,
citecolor=webgreen]{hyperref}

\definecolor{webgreen}{rgb}{0,.5,0}
\definecolor{webbrown}{rgb}{.6,0,0}

\usepackage{color}
\usepackage{fullpage}
\usepackage{float}

\usepackage{psfig}
\usepackage{graphics,amsmath,amssymb}
\usepackage{amsthm}
\usepackage{amsfonts}
\usepackage{latexsym}
\usepackage{epsf}

\setlength{\textwidth}{6.5in}
\setlength{\oddsidemargin}{.1in}
\setlength{\evensidemargin}{.1in}
\setlength{\topmargin}{-.5in}
\setlength{\textheight}{8.9in}

\newcommand{\seqnum}[1]{\href{http://oeis.org/#1}{\underline{#1}}}

\begin{document}

\begin{center}
\epsfxsize=4in
\leavevmode\epsffile{logo129.eps}
\end{center}

\begin{center}
\vskip 1cm{\LARGE\bf The $r$-Bell Numbers
}
\vskip 1cm
\large
Istv\'an Mez\H{o}\\
Department of Applied Mathematics and Probability Theory\\
Faculty of Informatics\\
University of Debrecen\\
P. O. Box 12\\
H-4010 Debrecen \\
Hungary\\
\href{mailto:mezo.istvan@inf.unideb.hu}{\tt mezo.istvan@inf.unideb.hu} \\
\end{center}

\vskip .2 in

\begin{abstract}
The notion of $r$-Stirling numbers implies the
definition of generalized Bell (or $r$-Bell) numbers. The $r$-Bell
numbers have appeared in several works, but there is no systematic treatise
on this topic. In this paper we fill this gap. We discuss the most
important combinatorial, algebraic and analytic properties of these
numbers, which generalize similar properties of the Bell numbers. Most
of these results seem to be new. It turns out that in a paper of
Whitehead, these numbers appeared in a very different context. In
addition, we study the so-called $r$-Bell polynomials.
\end{abstract}

\theoremstyle{plain}
\newtheorem{theorem}{Theorem}
\newtheorem{corollary}[theorem]{Corollary}
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{proposition}[theorem]{Proposition}

\theoremstyle{definition}
\newtheorem{definition}[theorem]{Definition}
\newtheorem{example}[theorem]{Example}
\newtheorem{conjecture}[theorem]{Conjecture}

\theoremstyle{remark}
\newtheorem{remark}[theorem]{Remark}


\newcommand{\NN}{\mathbb{N}}
\newcommand{\ZZ}{\mathbb{Z}}
\newcommand{\QQ}{\mathbb{Q}}
\newcommand{\im}{\mbox{\upshape Im}}

\newcommand{\stirlings}[2]{\genfrac\{\}{0pt}{}{#1}{#2}}
\newcommand{\stirlingf}[2]{\genfrac[]{0pt}{}{#1}{#2}}

\newtheorem{Theorem}{Theorem}[section]
\newtheorem{Proposition}[Theorem]{Proposition}
\newtheorem{Corollary}[Theorem]{Corollary}
\theoremstyle{definition}
\newtheorem{Example}[Theorem]{Example}
\newtheorem{Remark}[Theorem]{Remark}
\newtheorem{Problem}[Theorem]{Problem}

\section{Introduction}

The Bell number $B_n$ \cite{Comtet} counts the partitions of a set with $n$ elements. The Stirling number with parameters $n$ and $k$, denoted by $\stirlings{n}{k}$, enumerates the number of partitions of a set with $n$ elements consisting $k$ disjoint, nonempty sets. We get immediately that $B_n$ can be given by the sum
\begin{equation}
B_n=\sum_{k=0}^n\stirlings{n}{k}.\label{Belldef}
\end{equation}
The numbers $\stirlings{n}{k}$ are also called as Stirling partition numbers. The $n$-th Bell polynomial is
\[B_n(x)=\sum_{k=0}^n\stirlings{n}{k}x^k.\]
These numbers and polynomials have many interesting properties and appear in several combinatorial identities. A comprehensive paper is \cite{Comtet}.

A more general notion can be introduced. The $r$-Stirling number of the second kind with parameters $n\ge k\ge r$ enumerates the partitions of a set of $n$ elements into $k$ nonempty, disjoint subsets such that the first $r$ elements are in distinct subsets. It is denoted by $\stirlings{n}{k}_r$. A systematic treatment on the $r$-Stirling numbers is given in \cite{Broder}, and a different approach is described in \cite{Carlitz1,Carlitz2}. According to \eqref{Belldef}, it seems to be natural to define the numbers
\begin{equation}
B_{n,r}=\sum_{k=0}^n\stirlings{n+r}{k+r}_r.\label{rBelldef}
\end{equation}
(It is obvious that $B_n=B_{n,0}$, because $\stirlings{n}{k}=\stirlings{n}{k}_0$ by the definitions.)

The very first question is on the meaning of the $r$-Bell numbers. By \eqref{rBelldef}, $B_{n,r}$ is the number of the partitions of a set with $n+r$ element such that the first $r$ elements are in distinct subsets in each partition.

The name of $r$-Stirling numbers suggests the name for the numbers $B_{n,r}$: we call them as $r$-Bell numbers, and the name of the polynomials
\[B_{n,r}(x)=\sum_{k=0}^n\stirlings{n+r}{k+r}_rx^k\]
will be $r$-Bell polynomials (see also the title of \cite{Corcino}). Thus $B_{n,r}=B_{n,r}(1)$ and $B_{n,0}(x)=B_{n}(x)$, the ordinary Bell polynomial.

\subsection{Some elementary facts about the $r$-Bell polynomials}

Actually, the coefficients of $B_{n,r}(x)$ are polynomials in $r$, since
\begin{equation}
\stirlings{n+r}{k+r}=\sum_{i=0}^n\binom{n}{i}\stirlings{i}{k}r^{n-i}.\label{rstid}
\end{equation}
That is,
\begin{equation}
B_{n,r}(x)=\sum_{k=0}^n\left(\sum_{i=0}^n\binom{n}{i}\stirlings{i}{k}r^{n-i}\right)x^k.\label{BnrB}
\end{equation}
The equality \eqref{rstid} can be proven easily: $\stirlings{n+r}{k+r}_r$ enumerates the $(k+r)$-partitions of $n+r$ elements such that the first $r$ elements are in distinct subsets. The number of such partitions can be enumerated in the following way. We separate $1,\dots,r$ into singletons, and we create $k$ additional blocks to have $k+r$ blocks. To fill the $k$ blocks, we choose $i$ elements from $\{r+1,\dots,n+r\}$ into them. This can happen $\binom{n}{i}$ way. We can construct $\stirlings{i}{k}$ different $k$-partitions from these elements. The remaining $n-i$ elements from $\{r+1,\dots,n+r\}$ go beside the first $r$ elements. We may choose these blocks independently, so we have $r^{n-i}$ possibilities. Finally we sum on $i$.

A consequence is that the $r$-Bell polynomials can be expressed by the Bell polynomials:
\[B_{n,r}(x)=\sum_{k=0}^nr^k\binom{n}{k}B_{n-k}(x).\]
To see the validity of this identity, just change the order of the summations in $\eqref{BnrB}$.

As far as we know, this paper is the first one fully devoted to the $r$-Bell numbers, although Carlitz \cite{Carlitz1,Carlitz2} defined these numbers and proved some identities for them. His original notation was $B(n,r)$ such that
\[B_{n,r}=B(n,r).\]

\section{Example and tables}

The following example illuminates again the meaning of the $r$-Bell numbers. By definition,
\[B_{2,2}=\stirlings{4}{2}_2+\stirlings{4}{3}_2+\stirlings{4}{4}_2.\]
$\stirlings{4}{2}_2$ counts the partitions of $4$ element into $2$ subsets such that the first $2$ element are in distinct subsets:
\[\{1,3,4\},\{2\}\quad;\quad\{1\},\{2,3,4\}\quad;\quad\{1,3\},\{2,4\}\quad;\quad\{1,4\},\{2,3\}.\]
$\stirlings{4}{3}_2$ belongs to the partitions
\[\{1\},\{2\},\{3,4\}\quad;\quad\{1,3\},\{2\},\{4\}\quad;\quad\{1,4\},\{2\},\{3\}\quad;\]
\[\{1\},\{2,3\},\{4\}\quad;\quad\{1\},\{2,4\},\{3\}.\]
Finally, $\stirlings{4}{4}_2$ equals to the number of partitions of $4$ elements into $4$ subsets (and necessarily, the first two elements are in distinct subsets):
\[\{1\},\{2\},\{3\},\{4\}.\]
That is,
\[B_{2,2}=\stirlings{4}{2}_2+\stirlings{4}{3}_2+\stirlings{4}{4}_2=4+5+1=10\]
is the number of partitions of the set $\{1,2,3,4\}$ such that the first two elements are in distinct subsets.

\begin{figure}
\caption{The first few $r$-Bell numbers}
\begin{center}
\begin{tabular}{r|cccccccc}&amp;$n=0$&amp;$n=1$&amp;$n=2$&amp;$n=3$&amp;$n=4$&amp;$n=5$&amp;$n=6$&amp;\\\hline
$r=0$&amp;1&amp;1&amp;2&amp;5&amp;15&amp;52&amp;203\\
$r=1$&amp;1&amp;2&amp;5&amp;15&amp;52&amp;203&amp;877\\
$r=2$&amp;1&amp;3&amp;10&amp;37&amp;151&amp;674&amp;3263\\
$r=3$&amp;1&amp;4&amp;17&amp;77&amp;372&amp;1915&amp;10481\\
$r=4$&amp;1&amp;5&amp;26&amp;141&amp;799&amp;4736&amp;29371\\
$r=5$&amp;1&amp;6&amp;37&amp;235&amp;1540&amp;10427&amp;73013\\
$r=6$&amp;1&amp;7&amp;50&amp;365&amp;2727&amp;20878&amp;163967
\end{tabular}
\end{center}
\end{figure}

\begin{figure}
\caption{The first few $r$-Bell polynomials}
\begin{eqnarray*}
B_{0,r}(x)&amp;=&amp;1\\
B_{1,r}(x)&amp;=&amp;x+r\\
B_{2,r}(x)&amp;=&amp;x^2+(2r+1)x+r^2\\
B_{3,r}(x)&amp;=&amp;x^3+(3r+3)x^2+(3r^2+3r+1)x+r^3\\
B_{4,r}(x)&amp;=&amp;x^4+(4r+6)x^3+(6r^2+12r+7)x^2+\\&amp;&amp;(4r^3+6r^2+4r+1)x+r^4
\end{eqnarray*}
\end{figure}

\section{Generating functions}

We start to derive the properties of $r$-Bell numbers and polynomials. First of all, the generating functions are determined.

\begin{Theorem}The exponential generating function for the $r$-Bell polyno\-mials is
\[\sum_{n=0}^\infty B_{n,r}(x)\frac{z^n}{n!}=e^{x(e^z-1)+rz}.\]
\end{Theorem}

\begin{proof}Broder \cite{Broder} gave the double generating function of $r$-Stirling numbers
\[\sum_{n=0}^\infty\left(\sum_{k=0}^n\stirlings{n+r}{k+r}x^k\right)\frac{z^n}{n!}=e^{x(e^z-1)+rz}.\]
The inner sum is exactly our polynomial $B_{n,r}(x)$. We note that this identity is remarked in \cite[eq.\ (3.19)]{Carlitz1}
\end{proof}

We remark that the non-polynomial version was proven by Carlitz \cite[eq.\ (3.18)]{Carlitz1}.

In order to determine the ordinary generating function we need some other notions. The falling factorial of a given real number $x$ is denoted and defined by
\begin{equation}
x^{\underline{n}}=x(x-1)(x-2)\cdots(x-n+1),\quad(n=1,2,\dots)\label{fallfact}
\end{equation}
and $(x)^{\underline{0}}=1$, while the rising factorial (a.k.a. Pochhammer symbol) is
\begin{equation}
(x)_n\equiv x^{\overline{n}}=x(x+1)(x+2)\cdots(x+n-1)\quad(n=1,2,\dots)\label{poch}
\end{equation}
with $(x)_0=1$. It is obvious that $(1)_n=n!$. Fitting our notations to the theory of hypergeometric functions defined below, we apply the notation $(x)_n$ instead of $x^{\overline{n}}$. The next transformation formula holds
\begin{equation}
x^{\underline{n}}=(-1)^n(-x)_n.\label{pochtrans}
\end{equation}
The hypergeometric function (or hypergeometric series) is defined by
\[{_p}{F}{_q}\left(\left.\begin{tabular}{llll}$a_1,$&amp;$a_2,$&amp;$\dots,$&amp;$a_p$\\$b_1,$&amp;$b_2$,&amp;$\dots,$&amp;$b_q$\end{tabular}\right|t\right)=\sum_{k=0}^\infty\frac{(a_1)_k(a_2)_k\cdots(a_p)_k}{(b_1)_k(b_2)_k\cdots(b_q)_k}\frac{t^k}{k!}.\]
The ordinary generating function of $B_{n,r}(x)$ can be given by this function.

\begin{Theorem}The $r$-Bell polynomials have the generating function
\[\sum_{n=0}^\infty B_{n,r}(x)z^n=\frac{-1}{rz-1}\,\frac{1}{e^x}\,{_1}{F}{_1}\left(\left.\begin{tabular}{llll}$\;\,\frac{rz-1}{z}$\\$\frac{rz+z-1}{z}$\end{tabular}\right|x\right).\]
\end{Theorem}

\begin{proof}It is known \cite{Broder} that for the Stirling numbers
\[\sum_{n=0}^\infty\stirlings{n}{m}_rz^n=\frac{z^m}{(1-rz)(1-(r+1)z)\cdots(1-mz)}\quad(m\ge r\ge 0).\]
This can be rewritten as
\[\sum_{n=m}^\infty\stirlings{n+r}{m+r}_rz^n=\frac{z^m}{(1-rz)(1-(r+1)z)\cdots(1-(m+r)z)}.\]
We transform the denominator using the falling factorial:
\[(1-rz)(1-(r+1)z)\cdots(1-(m+r)z)\]
\[=\frac{(1-z)(1-2z)\cdots(1-(m+r)z)}{(1-z)(1-2z)\cdots(1-(r-1)z)}=\frac{z^{m+1}\left(\frac{1}{z}\right)^{\underline{m+r+1}}}{\left(\frac{1}{z}\right)^{\underline{r}}}.\]
Hence
\[\sum_{k=m}^\infty\stirlings{k+r}{m+r}_rz^k=\frac{1}{z}\left(\frac{1}{z}\right)^{\underline{r}}\frac{1}{\left(\frac{1}{z}\right)^{\underline{m+r+1}}}.\]
Equality \eqref{pochtrans} and definitions \eqref{fallfact}-\eqref{poch} give that
\[\left(\frac{1}{z}\right)^{\underline{m+r+1}}=(-1)^{m+r+1}\left(-\frac{1}{z}\right)_{m+r+1}\]
\[=(-1)^{m+r+1}\left(-\frac{1}{z}\right)_{r+1}\left(-\frac{1}{z}+r+1\right)_m.\]
Consequently,
\[\sum_{n=m}^\infty\stirlings{n+r}{m+r}_rz^n=\frac{1}{z}\frac{\left(\frac{1}{z}\right)^{\underline{r}}}{\left(-\frac{1}{z}\right)_{r+1}}\frac{(-1)^{m+r+1}}{\left(\frac{rz+z-1}{z}\right)_m}.\]
Since
\[\frac{\left(\frac{1}{z}\right)^{\underline{r}}}{\left(-\frac{1}{z}\right)_{r+1}}=(-1)^r\frac{z}{rz-1},\]
we get that
\[\sum_{n=m}^\infty\stirlings{n+r}{m+r}_rz^n=\frac{-1}{rz-1}\frac{(-1)^m}{\left(\frac{rz+z-1}{z}\right)_m}.\]
We multiply both sides by $x^m$ and take summation over the non-negative integers:
\[\sum_{n=0}^\infty B_{n,r}(x)z^n=\frac{-1}{rz-1}\sum_{m=0}^\infty\frac{(-x)^m}{\left(\frac{rz+z-1}{z}\right)_m}=\frac{-1}{rz-1}\,{_1}{F}{_1}\left(\left.\begin{tabular}{llll}$\;\;\;\;1$\\$\frac{rz+z-1}{z}$\end{tabular}\right|-x\right).\]
Finally, we apply Kummer's formula \cite[p.\ 505]{Abramowitz}
\[e^{-x}\,{_1}{F}{_1}\left(\left.\begin{tabular}{llll}$a$\\$b$\end{tabular}\right|x\right)=\,{_1}{F}{_1}\left(\left.\begin{tabular}{llll}$b-a$\\$\;\;\;b$\end{tabular}\right|-x\right)\]
with $b=\frac{rz+z-1}{z}$ and $a=\frac{rz-1}{z}$.
\end{proof}

\section{Basic recurrences}

In an earlier paper of the author \cite{Mezo}, the polynomials $B_{n,r}(x)$ were introduced because of a very different reason. These functions were used to study the unimodality of $r$-Stirling numbers and some properties of them were proven in that paper. We repeat those results without proof.

\begin{Theorem}We have the following recursive identities:
\begin{eqnarray*}
B_{n,r}(x)&amp;=&amp;x\left(\frac{d}{dx}B_{n-1,r}(x)+B_{n-1,r}(x)\right)+rB_{n-1,r}(x),\\
e^xx^rB_{n,r}(x)&amp;=&amp;x\frac{d}{dx}\left(e^xx^rB_{n-1,r}(x)\right).
\end{eqnarray*}
Moreover, all zeros of $B_{n,r}(x)$ are real and negative.
\end{Theorem}

Straightforward corollaries are that for a fixed $r$ the constant term of the $n$-th polynomial is $r^n$:
\[B_{n,r}(0)=r^n,\]
and that the derivative of an $r$-Bell polynomial is determined by the relation
\[\frac{d}{dx}B_{n,r}(x)=\frac{B_{n+1,r}(x)}{x}-\frac{rB_{n,r}(x)}{x}-B_{n,r}(x).\]

The identity
\[\stirlings{n+r}{k+r}_r=\stirlings{n+r}{k+r}_{r-1}-(r-1)\stirlings{n-1+r}{k+r}_{r-1}\]
was proven in \cite[p.\ 245]{Broder} and implies the recurrence relation
\[B_{n,r}(x)=xB_{n-1,r+1}(x)+rB_{n-1,r}(x).\]

\begin{Theorem}The next polynomial identity is valid:
\[B_{n,r}(x)=rB_{n-1,r}(x)+x\sum_{k=0}^{n-1}\binom{n-1}{k}B_{k,r}(x).\]
\end{Theorem}
\begin{proof}We give a combinatorial proof for the non-polynomial version ($x=1$). First we rearrange the sum on the right hand side:
\[\sum_{k=0}^{n-1}\binom{n-1}{k}B_{k,r}=\sum_{k=0}^{n-1}\binom{n-1}{n-1-k}B_{n-1-k,r}=\sum_{k=0}^{n-1}\binom{n-1}{k}B_{n-1-k,r}.\]
Hence we need to prove that
\[B_{n,r}=rB_{n-1,r}+\sum_{k=0}^{n-1}\binom{n-1}{k}B_{n-1-k,r}.\]
If we construct partitions on $n+r$ elements and the first $r$ elements are in distinct blocks, then we have two possibilities: 1) the last element, $n+r$, belongs to a block containing one of the first elements. Such partition can be constructed such that we construct a partition of $\{1,2,\dots,n+r-1\}$ and then put the last element into the block containing $1$ or $2\dots$ or $r$. We see that there are $rB_{n-1,r}$ possibilities. 2) the last element belongs to a block \emph{not} containing $1$, $2,\dots$ and $r$. Now we may choose $k$ other elements from $\{r+1,\dots,n+r-1\}$ into the block of $n$. There are $\binom{n-1}{k}$ ways to do this. Then the remaining $n-1-k$ elements build up a partition (such that $1,\dots,r$ are in different blocks). This can be done $B_{n-1-k,r}$ ways. Last, we take summation over all the possible values of $k$.
\end{proof}

Closing this section, we cite Carlitz's identities \cite[eq.\ (3.22-3.23)]{Carlitz1}:
\begin{eqnarray}
B_{n+m,r}&amp;=&amp;\sum_{j=0}^m\stirlings{m+r}{j+r}_rB_{n,r+j},\label{Carlitzeq}\\
B_{n,r+m}&amp;=&amp;\sum_{j=0}^m(-1)^{m-j}\stirlingf{m+r}{j+r}_rB_{n+j,r}.\nonumber
\end{eqnarray}
Here $\stirlingf{n}{m}_r$ is an $r$-Stirling number of the first kind (see \cite{Broder,Carlitz1,Carlitz2}).

\section{Dobinski's formula}

The Bell numbers are involved in Dobinski's nice formula \cite{Chowla,Dobinski,GKP,Pitman}:
\[B_n=\frac{1}{e}\sum_{k=0}^\infty\frac{k^n}{k!}.\]
Our goal is to generalize this identity to our case.

\begin{Theorem}[Dobinski's formula]The $r$-Bell polynomials satisfy the\\i\-den\-ti\-ty
\[B_{n,r}(x)=\frac{1}{e^x}\sum_{k=0}^\infty\frac{(k+r)^n}{k!}x^k.\]
Consequently, the $r$-Bell numbers are given by
\[B_{n,r}=\frac{1}{e}\sum_{k=0}^\infty\frac{(k+r)^n}{k!}.\]
\end{Theorem}

\begin{proof}The $r$-Stirling numbers for a fixed $n$ (and $r$) have the ``horizontal'' generating function \cite{Broder}
\[(x+r)^n=\sum_{k=0}^n\stirlings{n+r}{k+r}_rx^{\underline{k}},\]
whence, for an arbitrary integer $m$,
\[\frac{(m+r)^n}{m!}=\sum_{k=0}^m\stirlings{n+r}{k+r}_r\frac{1}{(m-k)!}.\]
In the next step we multiply both sides by $x^m$ and sum from $m=0$ to $\infty$. Then
\[\sum_{m=0}^\infty\frac{(m+r)^n}{m!}x^m=\sum_{m=0}^\infty\sum_{k=0}^m\stirlings{n+r}{k+r}_r\frac{x^m}{(m-k)!}=\]
\[e^x\left(\sum_{k=0}^n\stirlings{n+r}{k+r}_rx^k\right)=e^xB_{n,r}(x).\]
\end{proof}

We can determine some interesting sums with the aid of $r$-Bell numbers. For example, we know from the second paragraph that $B_{2,2}=10$, so
\[\frac{1}{e}\sum_{k=0}^\infty\frac{(k+2)^2}{k!}=10.\]

\section{An integral representation}

In 1885, Ces\`aro \cite{Cesaro} found a remarkable integral representation of the Bell numbers (see also \cite{Becker,Callan}):
\[B_n=\frac{2n!}{\pi e}\,\im\int_0^\pi e^{e^{e^{i\theta}}}\sin(n\theta)d\theta.\]
It is not hard to deduce the ``$r$-Bell version''.

\begin{Theorem}The $r$-Bell numbers have the integral representation
\[B_{n,r}=\frac{2n!}{\pi e}\,\im\int_0^\pi e^{e^{e^{i\theta}}}e^{re^{i\theta}}\sin(n\theta)d\theta.\]
\end{Theorem}

\begin{proof}In \cite{Carlitz1} we find that
\begin{equation}
k!\stirlings{n+r}{k+r}_r=\sum_{j=0}^k(-1)^{k-j}\binom{k}{j}(j+r)^n.\label{stirlingeq}
\end{equation}
In the next step we use the next equality \cite{Callan}:
\begin{equation}
\im\int_0^\pi e^{je^{i\theta}}\sin(n\theta)d\theta=\frac{\pi}{2}\frac{j^n}{n!}.\label{sinint}
\end{equation}
Unifying equations \eqref{stirlingeq} and \eqref{sinint}, we get that
\begin{eqnarray*}
&amp;&amp;\frac{\pi}{2}\frac{1}{n!}\stirlings{n+r}{k+r}_r=\frac{1}{k!}\sum_{j=0}^k(-1)^{k-j}\binom{k}{j}\im\int_0^\pi e^{(j+r)e^{i\theta}}\sin(n\theta)d\theta\\
&amp;=&amp;\frac{1}{k!}\im\int_0^\pi\left[\sum_{j=0}^k(-1)^{k-j}\binom{k}{j} \left({e^{e^{i\theta}}}\right)^j\right]e^{re^{i\theta}}\sin(n\theta)d\theta\\
&amp;=&amp;\im\int_0^\pi\frac{\left(e^{e^{i\theta}}-1\right)^k}{k!}e^{re^{i\theta}}\sin(n\theta)d\theta,
\end{eqnarray*}
whence
\[\sum_{k=0}^\infty\stirlings{n+r}{k+r}_r=\frac{2n!}{\pi}\im\int_0^\pi\left(\sum_{k=0}^\infty\frac{\left(e^{e^{i\theta}}-1\right)^k}{k!}\right)e^{re^{i\theta}}\sin(n\theta)d\theta,\]
and the result follows.
\end{proof}

The imaginary part of the above integral can be calculated with a bit of effort:
\[B_{n,r}=\frac{2n!}{\pi e}\int_0^\pi e^{e^{cos\theta}\cos\sin\theta+r\cos\theta}\cdot\]
\[\cdot\left[\cos(e^{\cos\theta}\sin\sin\theta)\sin(r\sin\theta)+\sin(e^{\cos\theta}\sin\sin\theta)\cos(r\sin\theta)\right]\sin(n\theta)d\theta.\]
Without the $r$-Bell numbers in background, the evaluation of this integral seems to be impossible\dots

Citing the general version of Dobinski's formula we find the compelling identity
\[\sum_{k=0}^\infty\frac{(k+r)^n}{k!}=\frac{2n!}{\pi}\,\im\int_0^\pi e^{e^{e^{i\theta}}}e^{re^{i\theta}}\sin(n\theta)d\theta.\]

\section{Hankel transformation and log-convexity}

Since
\[e^t\sum_{n=0}^\infty B_{n,r}(x)\frac{t^n}{n!}=e^{x(e^t-1)+(r+1)t},\]
Cauchy's product immediately implies the next

\begin{Theorem}\label{thm:binomtransform}The $r$-Bell polynomials satisfy the relations
\begin{eqnarray*}
B_{n,r+1}(x)&amp;=&amp;\sum_{k=0}^n\binom{n}{k}B_{k,r}(x),\\
B_{n,r}(x)&amp;=&amp;\sum_{k=0}^n\binom{n}{k}(-1)^{n-k}B_{k,r+1}(x).
\end{eqnarray*}
\end{Theorem}

An interesting corollary is connected to the Hankel transform. The $H$ Hankel matrix \cite{Layman} of an integer sequence $(a_n)$ is
\[H=\begin{pmatrix}a_0&amp;a_1&amp;a_2&amp;a_3&amp;\cdots\\a_1&amp;a_2&amp;a_3&amp;a_4&amp;\cdots\\a_2&amp;a_3&amp;a_4&amp;a_5&amp;\cdots\\\vdots&amp;\vdots&amp;\vdots&amp;\vdots&amp;\ddots\end{pmatrix},\]
while the Hankel matrix of order $n$, denoted by $h_n$, is the upper-left submatrix of $H$ of size $n\times n$. The Hankel transform of the sequence $(a_n)$ is again a sequence formed by the determinants of the matrices $h_n$.

A notable result of Aigner and Lenard \cite{Aigner,Lenard} is that the Hankel transform of the Bell numbers is $(1!,1!2!,1!2!3!,\dots)$, that is, for any fixed $n$,
\[\begin{vmatrix}B_0&amp;B_1&amp;B_2&amp;\cdots&amp;B_n\\B_1&amp;B_2&amp;B_3&amp;\cdots&amp;B_{n+1}\\\vdots&amp;\vdots&amp;\vdots&amp;&amp;\vdots\\B_n&amp;B_{n+1}&amp;B_{n+2}&amp;\cdots&amp;B_{2n}\end{vmatrix}=\prod_{i=0}^n i!\]

We can determine the Hankel transform of $r$-Bell numbers easily. To reach this aim, we recall the next notion. If $(a_n)$ is a sequence, then its binomial transform $(b_n)$ is defined by the relation
\[b_n=\sum_{k=0}^n\binom{n}{k}(-1)^{n-k}a_k,\]
while the inverse transform is
\[a_n=\sum_{k=0}^n\binom{n}{k}b_k.\]
See the paper \cite{Riordan} on these transformations, for instance. A useful theorem of Layman \cite{Layman} states that any integer sequence has the same Hankel transform as its binomial transform. Then Theorem \ref{thm:binomtransform} yields the next

\begin{Corollary}The $r$-Bell numbers have the Hankel transform
\[\begin{vmatrix}B_{0,r}&amp;B_{1,r}&amp;B_{2,r}&amp;\cdots&amp;B_{n,r}\\B_{1,r}&amp;B_{2,r}&amp;B_{3,r}&amp;\cdots&amp;B_{n+1,r}\\\vdots&amp;\vdots&amp;\vdots&amp;&amp;\vdots\\B_{n,r}&amp;B_{n+1,r}&amp;B_{n+2,r}&amp;\cdots&amp;B_{2n,r}\end{vmatrix}=\prod_{i=0}^n i!\]
\end{Corollary}

Professor J. Cigler \cite{Cigler} calculated more general identities with respect to Hankel determinants involving not only $r$-Bell numbers but polynomials. We cite his unpublished results here.

Let $d(n,k)=\det(B_{i+j+k,r}(x))_{i,j=0}^{n-1}$. Cigler's results are the following:
\[d(n,0)=x^{\binom{n}{2}}\prod_{k=0}^{n-1}k!,\]
and
\[d(n,1)=x^{\binom{n}{2}}\prod_{k=0}^{n-1}k!\sum_{k=0}^n\binom{n}{k}x^k(r)_{n-k}.\]

\section{Some occurrences of the $r$-Bell numbers}

Surprisingly, the $r$-Bell numbers turned up in a table of Whitehead's paper \cite{Whitehead}. In his table, the $(n,i)$-entry is denoted by $b_{n,i}$ and it is the sum of the coefficients of the polynomial $x^i(x)_{n-i}$ with respect to the so-called complete graph base. A more detailed description on this graph theoretical notion can be found in the paper \cite{Whitehead} and the references therein.

Our $r$-Bell numbers are exactly the entries of that table, more exactly,
\begin{equation}
B_{n,r}=b_{n+r,n}\quad(n\ge1).\label{whitrec}
\end{equation}
From this observation we get straightaway the next identity.

\begin{Theorem}We have for all $n\ge 1$ that
\[B_{n,r}=rB_{n-1,r}+B_{n-1,r+1}.\]
\end{Theorem}

\begin{proof}According to \cite{Whitehead}, the entries $b_{n,i}$ satisfy the recurrence
\[(n-i)b_{n,i}+b_{n+1,i}=b_{n+1,i+1}.\]
Then \eqref{whitrec} implies the statement. On the other hand, this theorem is a special case of \eqref{Carlitzeq} but it is worthwhile to give a different viewpoint.
\end{proof}

We note that the ``row sum'' in the table of Whitehead can be expressed by the $r$-Bell numbers, too.
\[\sum_{i=1}^nb_{n,i}=\sum_{i=1}^nB_{i,n-i}.\]

Identification \eqref{whitrec} gives also that the $r$-Bell numbers have meaning in the theory of chromatic polynomials.

Another occurrence is the following.
The $r$-Bell numbers come from a problem on the maximum of $r$-Stirling numbers (see \cite{Mezo}). The author proved there that all zeros of the polynomial $B_{n,r}(x)$ are real. This implies that
\[\stirlings{n}{k}_r^2\ge\stirlings{n}{k+1}_r\stirlings{n}{k-1}_r,\]
which is an important relation -- for example -- in the theory of combinatorial sequences. In addition, the maximizing index of $r$-Stirling numbers of the second kind can be expressed approximately by the $r$-Bell numbers \cite{Mezo}. Namely,
\[\left|K-\left(\frac{B_{n+1,r}}{B_{n,r}}-(r+1)\right)\right|&lt;1,\]
where $K$ is the parameter, for which
\[\stirlings{n+r}{K}_r\ge\stirlings{n+r}{k}_r\]
for all $k=r,r+1,\dots,n+r$.

We remark that (beside the papers cited above), there are other articles in which the $r$-Bell numbers (at least implicitly) appear. C. B. Corcino \cite{Corcino} deals with the asymptotic properties of these numbers. The paper of Hsu and Shiue \cite{Hsu} concerns the Stirling-type pairs. In that article a generalized Dobinski formula is presented.


\section{Acknowledgement}

I thank Professor Cigler for his suggestions and results on Hankel determinants of $r$-Bell polynomials.

I also appreciate that Jonathan Vos Post uploaded the table of $r$-Bell numbers (see A134980 in \cite{Sloane}).

Moreover, I would like to thank the referee for his/her useful suggestions and improvements.


\begin{thebibliography}{99}

\bibitem[1]{Abramowitz}
M. Abramowitz and I. A. Stegun, eds.,
\textit{Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables} (9th printing), Dover, 1972.

\bibitem[2]{Aigner}M. Aigner, A characterization of the Bell numbers, \textit{Discrete Math}. \textbf{205} (1999), 207--210.

\bibitem[3]{Becker}
H. W. Becker and D. H. Browne, Problem E461 and solution, \textit{Amer. Math. Monthly} \textbf{48} (1941), 701--703.

\bibitem[4]{Broder}
A. Z. Broder, The $r$-Stirling numbers, \textit{Discrete Math.} \textbf{49} (1984), 241--259.

\bibitem[5]{Callan}
D. Callan, Cesaro's integral formula for the Bell numbers (corrected). 
\href{http://www.stat.wisc.edu/~callan/notes/}{\tt http://www.stat.wisc.edu/\char'176callan/notes/}.

\bibitem[6]{Carlitz1}
L. Carlitz, Weighted Stirling numbers of the first and second kind -- I, \textit{Fibonacci Quart.} \textbf{18} (1980), 147--162.

\bibitem[7]{Carlitz2}
L. Carlitz, Weighted Stirling numbers of the first and second kind -- II, \textit{Fibonacci Quart.} \textbf{18} (1980), 242--257.

\bibitem[8]{Cesaro}
M. E. Ces\`aro, Sur une \'equation aux diff\'erences mel\'ees, \textit{Nouv. Ann. Math.} \textbf{4} (1885), 36--40.

\bibitem[9]{Chowla}
S. Chowla and M. B. Nathanson, Mellin's formula and some combinatorial
identities, \textit{Monat. Math.} \textbf{81} (1976), 261--265.

\bibitem[10]{Cigler}
J. Cigler, Personal communication.

\bibitem[11]{Comtet}
L. Comtet, \textit{Advanced Combinatorics}, D. Reidel, 1974.

\bibitem[12]{Corcino}
C. B. Corcino, An asymptotic formula for the $r$-Bell numbers,
\textit{Mati\-my\-\'as Mat.} \textbf{24} (2001), 9--18.

\bibitem[13]{Dobinski}
G. Dobi\'nski, Summirung der Reihe $\sum n^m/n!$ f\"ur $m=1,2,$
$3,4,5,\dots$, \textit{Arch. f\"ur Mat. und Physik}
\textbf{61} (1877), 333--336.

\bibitem[14]{GKP}
R. L. Graham, D. E. Knuth, and O. Patashnik, \textit{Concrete Mathematics},
Addison-Wesley, 1994.

\bibitem[15]{Hsu}
L. C. Hsu and P. J-S. Shiue, A unified approach to generalized Stirling numbers, \textit{Adv. Appl. Math.} \textbf{20} (1998), 366--384.

\bibitem[16]{Layman}
J. W. Layman, The Hankel transform and some of its properties,
\textit{J. Integer Seq.} Vol. 4 (2001), 
\href{http://www.cs.uwaterloo.ca/journals/JIS/VOL4/LAYMAN/hankel.html}{Article 01.1.5}.

\bibitem[17]{Lenard}
M. Gardner, \textit{Fractal Music, Hypercards, and More...: Mathematical Recreations from Scientific American Magazine}, W. H. Freeman, 1992,
pp.\ 35--36.

\bibitem[18]{Mezo}
I. Mez\H{o}, On the maximum of $r$-Stirling numbers, \textit{Adv. Appl.
Math.} \textbf{41} (2008), 293--306.

\bibitem[19]{Pitman}
J. Pitman, Some probabilistic aspects of set partitions, \textit{Amer.
Math. Monthly} \textbf{104} (1997), 201--209.

\bibitem[20]{Riordan}
J. Riordan, Inverse relations and combinatorial identities,
\textit{Amer. Math. Monthly} \textbf{71} (1964), 485--498.

\bibitem[21]{Sloane}
N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences. Published electronically at \href{http://oeis.org/}{\tt http://oeis.org/}.

\bibitem[22]{Whitehead}
E. G. Whitehead, Stirling number identities from chroma\-tic po\-ly\-no\-mi\-als, \textit{J. Combin. Theory Ser. A} \textbf{24} (1978), 314--317.

\end{thebibliography}


\bigskip
\hrule
\bigskip

\noindent 2010 {\it Mathematics Subject Classification}:
Primary 05A18; Secondary 05A15.

\noindent \emph{Keywords: } Bell numbers, $r$-Bell numbers, Stirling
numbers, $r$-Stirling numbers, Hankel determinants, restricted
partitions.

\bigskip
\hrule
\bigskip

\noindent (Concerned with sequences
\seqnum{A000110},
\seqnum{A005493},
\seqnum{A005494},
\seqnum{A045379}, and
\seqnum{A134980}.)

\bigskip
\hrule
\bigskip

\vspace*{+.1in}
\noindent
Received November 1 2010;
revised version received December 19 2010. 
Published in {\it Journal of Integer Sequences}, December 19 2010.

\bigskip
\hrule
\bigskip

\noindent
Return to
\htmladdnormallink{Journal of Integer Sequences home page}{http://www.cs.uwaterloo.ca/journals/JIS/}.
\vskip .1in


\end{document}

                                                                                

</pre></body></html>