\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}

\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}

\begin{center}
\vskip 1cm{\LARGE\bf
Integer Sequences, Functions of Slow Increase,\\
\vskip .1in
and the Bell Numbers}
\vskip 1cm
\large
Rafael Jakimczuk\\
Divisi\'on Matem\'atica \\
Universidad Nacional de Luj\'an\\
Buenos Aires \\
Argentina\\ 
\href{mailto:jakimczu@mail.unlu.edu.ar}{\tt jakimczu@mail.unlu.edu.ar}\\
\end{center}

\centerline{In memory of my sister Fedra Marina Jakimczuk (1970--2010)} 

\vskip .2in

\begin{abstract}
In this article we first prove a general theorem on integer sequences
$A_n$ such that the following asymptotic formula holds,
\[\frac{A_{n}}{A_{n-1}}\sim C n^{\alpha} f(n)^{\beta},\] where $f(x)$
is a function of slow increase, $C>0$, $\alpha>0$ and $\beta$ is a real
number.

We also obtain some results on the Bell numbers $B_n$ using well-known formulae. 
We compare the Bell numbers with $a^n$ $(a>0)$ and $(n!)^h$ $(0<h\leq 1)$. 

Finally, applying the general statements proved in the article we
obtain the  formula \[B_{n+1}\sim
e\ \left(B_n\right)^{1+\frac{1}{n}}.\]
\end{abstract}

\section{Integer Sequences. A General Theorem.}

We shall need the following well-known lemmas \cite[pp.\ 332, 294]{ReyPastor12}.

\begin{lemma}\label{L1}
If $s_n$ is  a sequence of positive numbers with limit $s$ then the sequence
\[\sqrt[n]{s_1 s_2\cdots s_n}\]
has also limit $s$.
\end{lemma} 

\begin{lemma}\label{L2} 
The following limit holds,
\[\lim_{n\rightarrow \infty}\frac{\sqrt[n]{n!}}{n}=\frac{1}{e}.\]
\end{lemma}

We recall the definition of function of slow increase \cite[Definition 1 ]{Jakim7}.

\begin{definition}\label{D3}
Let $f(x)$ be a function defined on interval  $[a, \infty)$ such that $f(x)>0$, 
$\lim_{x\rightarrow \infty} f(x)=\infty $ and with continuous derivative $f'(x)>0$ .
The function $f(x)$ is of slow increase if and only if the following condition holds 
\begin{equation} \label{E1} 
\lim_{x\rightarrow \infty}\frac{ f'(x)}{\frac{f(x)}{x}}= \lim_{x\rightarrow \infty}\frac{xf'(x)}{f(x)}=0.
\end{equation}
\end{definition} 
Typical functions of slow increase are  $f(x)=\log x$, $f(x)=\log^2 x$ and $f(x)=\log\log x$. 

\begin{lemma}\label{L4} 
If $f(x)$ is a function of slow increase on the interval $[b, \infty)$ then the following asymptotic formula holds
\begin{equation}\label{E2}
\sqrt[n]{f(b) f(b+1) \cdots f(n)}	\sim f(n),
\end{equation}
where $b$ is a positive integer.
\end{lemma}
 
\begin{proof}
Note that we always can suppose that $f(x)>1$ on the interval $[b, \infty)$. 

Since $ \log f(x)$ is increasing and positive in the interval $[b,\infty)$ we find that
\begin{eqnarray}\label{E3}
\sum^{n}_{i=b}\log f(i)=\sum^{n}_{i=b}(1 \cdot \log f(i)) &=&\int^{n}_{b}\log f(x)\ dx + O(\log f(n))= n \log f(n)\nonumber\\&+&
\int^{n}_{b}\frac{x f'(x)}{f(x)}\ dx + O(\log f(n)).
\end{eqnarray}
Note that the second equation in (\ref {E3}) is a sum of areas of rectangles of height $\log f(i)$ and base 1. Consequently the third equation in (\ref {E3}) is immediate.

L'H\^{o}pital's rule  gives (see (\ref {E1}))
\[\lim_{x\rightarrow\infty}\frac{\log f(x)}{x}=\lim_{x\rightarrow\infty}\frac{f'(x)}{f(x)}= 0.\]
Therefore 
\begin{equation}\label{E4}
O(\log f(n))=o(n).
\end{equation}
If the integral $\int^{x}_{b}\frac{t f'(t)}{f(t)}\ dt$ converges we obtain
\[\lim_{x\rightarrow\infty}\frac{\int^{x}_{b}\frac{t f'(t)}{f(t)}\ dt}{x}=0.\]
On the other hand, if the integral $\int^{x}_{b}\frac{t f'(t)}{f(t)}\ dt$ diverges  we obtain from L'H\^{o}pital's rule and (\ref {E1}) that
\[\lim_{x\rightarrow\infty}\frac{\int^{x}_{b}\frac{t f'(t)}{f(t)}\ dt}{x}=0.\]
Therefore
\begin{equation}\label{E5}
\int^{n}_{b}\frac{x f'(x)}{f(x)}\ dx = o(n).
\end{equation}
Equations (\ref {E3}), (\ref {E4}) and (\ref {E5}) give
\begin{equation}\label{E6}
\sum^{n}_{i=b}\log f(i)= n \log f(n)+ o(n).
\end{equation}
That is,
\[\frac{1}{n}\sum^{n}_{i=b}\log f(i)=\log f(n)+ o(1).\]
That is (\ref {E2}). 
\end{proof}

\begin{theorem}\label{T5} 
Let $A_n$ $(n\geq 0)$ be a sequence of positive numbers (in particular integers) such that
\begin{equation}\label{E7}
\frac{A_{n}}{A_{n-1}}\sim C n^{\alpha} f(n)^{\beta},
\end{equation}
where $f(x)$ is a function of slow increase on the interval $[b, \infty)$, $C>0$, $\alpha>0$ and $\beta$ is a real number. If $1\leq n< b$ we put $f(n)=1$.

The following formulae hold,
\begin{equation}\label{E8}
\frac{\sqrt[n]{\frac{A_1}{A_0}\frac{A_2}{A_1}\cdots \frac{A_n}{A_{n-1}}}}{\frac{A_n}{A_{n-1}}}\rightarrow \frac{1}{e^{\alpha}},	
\end{equation}
\begin{equation}\label{E9}
A_{n+1}\sim e^{\alpha}A_n^{1+\frac{1}{n}},
\end{equation}
\begin{equation}\label{E10}
\log A_n=\alpha n \log n +\beta n \log f(n)+(-\alpha+\log C)n+o(n),
\end{equation} 
\begin{equation}\label{E11}
\log A_n \sim \alpha n \log n, 
\end{equation}
\begin{equation}\label{E12}
A_n=\frac{\left(C n^{\alpha} f(n)^{\beta}\right)^n}{e^{(\alpha+o(1))n}}.
\end{equation}
\end{theorem} 

\begin{proof}
We have (see (\ref {E7}))
\begin{equation}\label{E13}
\frac{\frac{A_{n}}{A_{n-1}}}{C n^{\alpha} f(n)^{\beta}} \rightarrow 1.	
\end{equation}
Consequently (\ref {E13}) and Lemma~\ref{L1} give
\[\sqrt[n]{\prod^{n}_{k=1} \frac{\frac{A_{k}}{A_{k-1}}}{C k^{\alpha} f(k)^{\beta}}}	=\frac{\sqrt[n]{\prod^{n}_{k=1} \frac{A_{k}}{A_{k-1}}}}{\sqrt[n]{\prod^{n}_{k=1}C k^{\alpha} f(k)^{\beta}}} \rightarrow 1.\]
That is
\begin{equation}\label{E14}
\sqrt[n]{A_n}\sim \sqrt[n]{\frac{A_1}{A_0}\frac{A_2}{A_1}\cdots\frac{A_n}{A_{n-1}}}\sim 
\sqrt[n]{\prod^{n}_{k=1}C k^{\alpha} f(k)^{\beta}}.
\end{equation}
Lemma~\ref{L2}  and Lemma~\ref{L4} give
\begin{equation}\label{E15}
\sqrt[n]{\prod^{n}_{k=1}C k^{\alpha} f(k)^{\beta}}= C \left(\sqrt[n]{n!}\right)^{\alpha}\left(\sqrt[n]{f(1) f(2)\cdots f(n)}\right)^{\beta}\sim
C \frac{n^{\alpha}}{e^{\alpha}}f(n)^{\beta}.
\end{equation}
Equations (\ref {E14}), (\ref {E15}) and (\ref {E7}) give
\begin{equation}\label{E16}
\sqrt[n]{A_n}\sim \sqrt[n]{\frac{A_1}{A_0}\frac{A_2}{A_1}\cdots\frac{A_n}{A_{n-1}}}\sim 
C \frac{n^{\alpha}}{e^{\alpha}}f(n)^{\beta}\sim \frac{1}{e^{\alpha}}\frac{A_n}{A_{n-1}}.
\end{equation}
Equation (\ref {E16}) gives (\ref {E8}). Equation (\ref {E16}) and \cite[Theorem 8]{Jakim7} give
\begin{equation}\label{E17}
A_n^{\frac{1}{n}}\sim A_{n-1}^{\frac{1}{n-1}}.	
\end{equation} 
Equations (\ref {E17}) and (\ref {E16}) give
\[A_n\sim e^{\alpha}A^{1+\frac{1}{n-1}}_{n-1}.\]
That is (\ref {E9}). Equation (\ref {E16}) gives
\[\frac{1}{n}\log A_n=\log \left(C \frac{n^{\alpha}}{e^{\alpha}}f(n)^{\beta}\right)+o(1).\]
That is (\ref {E10}). Equation (\ref {E10}) gives (\ref {E11}), since 
(from L'H\^{o}pital's rule and (\ref {E1}))
\[\lim_{x\rightarrow \infty}\frac{\log f(x)}{\log x}=\lim_{x\rightarrow \infty}\frac{xf'(x)}{f(x)}=0.\]
Finally, equation (\ref {E12}) is an immediate consequence of equation (\ref {E10}). 
\end{proof}
 
\begin{remark}\label{R6}
Note that: (i) The following limit holds $Cn^{\alpha}f(n)^{\beta}\rightarrow \infty$ (see(\ref {E7})). 

If $\beta\geq 0$ the proof is trivial. If $\beta<0$ use \cite[Theorem 2 and Theorem 4]{Jakim7}.
Consequently we have
\[\lim_{n\rightarrow \infty}\frac{A_{n+1}}{A_n}=\infty.\]
(ii) This last limit implies the following formula $(A_{n+1}-A_n) \sim A_{n+1}$. 

(iii) Equation (\ref {E7}) implies the more general relation,
\[\frac{A_n}{A_{n-m}}=\frac{A_n}{A_{n-1}}\frac{A_{n-1}}{A_{n-2}}\cdots \frac{A_{n-m+1}}{A_{n-m}}\sim C^{m}\prod^{n}_{k=n-m+1}k^{\alpha}f(k)^{\beta}.\]
\end{remark}
 


\section{Introduction to Bell Numbers. } 

The $n$-th Bell number $B_n$ is the number of partitions of a set of $n$ elements in disjoint subsets.

The Bell numbers satisfy the following recurrence relation \cite[p.\ 216]{Andrews1}.
\[B_0=1,\] 
\begin{equation}\label{E18}
B_{n+1}=\sum^{n}_{k=0}{{n}\choose{k}}B_k.
\end{equation}
The first Bell numbers are $B_0=1$, $B_1=1$, $B_2=2$, $B_3=5$, $B_4=15$, $B_5=52$, $B_6=203$, $B_7=877$, $B_8=4140$, $B_9=21147$, $B_{10}=115975$.
\\[0,5 cm]
N. G. de Bruijn \cite[pp.\ 102--109]{Bruijn6}	proved the following asymptotic formula,
\begin{equation}\label{E19}
\log B_n=n\log n	-n \log\log n-n+o(n).
\end{equation}
L. Lov\'asz \cite[Ex.\ 9(b), p.\ 17]{Lovasz10} proved the following asymptotic formula
\begin{equation}\label{E20}
B_n \sim n^{-\frac{1}{2}}\left(\lambda(n)\right)^{n+\frac{1}{2}}e^{\lambda(n)-n-1},
\end{equation}
where
\begin{equation}\label{E21}
\lambda(n)=\frac{n}{W(n)}.
\end{equation}
The function $x=W(y)$ is the inverse function of $y=x e^{x}$ on the interval $(0, \infty)$. The function $x=W(y)$ is called Lambert W-function.

The following results are well-known \cite {Corless5}. We establish these results in the next lemma. For sake of completeness we give a proof of the lemma.

\begin{lemma}\label{L7}
The function $x=W(y)$ is positive, strictly increasing on the interval $(0, \infty)$ and $\lim_{y\rightarrow \infty}W(y)=\infty$.

The following formulae hold.
\begin{equation}\label{E22}	
W(y)\sim \log y,
\end{equation}
\begin{equation}\label{E23}	
W'(y)=\frac{W(y)}{y(1+W(y))}.
\end{equation}
\end{lemma}

\begin{proof}
The first statement is trivial.

We have (definition of $x=W(y)$)
\begin{equation}\label{E24}
y=W(y) e^{W(y)}.	
\end{equation}
Consequently
\[1=W'(y)e^{W(y)}+W(y)e^{W(y)}W'(y).\]
That is
\[W'(y)=\frac{1}{e^{W(y)}(1+W(y))}=\frac{W(y)}{y(1+W(y))}.\]
On the other hand (\ref {E24}) gives
\[\log y=\log W(y)+W(y).\]
Therefore
\begin{equation}\label{E25}
\frac{W(y)}{\log y}=1-\frac{\log W(y)}{\log y}.	
\end{equation}
Also (from L'H\^{o}pital's rule and (\ref {E23}))
\begin{equation}\label{E26}
\lim_{y\rightarrow \infty}\frac{\log W(y)}{\log y}= \lim_{y\rightarrow \infty}\frac{yW'(y)}{W(y)}	=\lim_{y\rightarrow \infty}\frac{1}{1+W(y)}=0.
\end{equation}
Finally, equations (\ref {E25}) and (\ref {E26}) give (\ref {E22}). 
\end{proof} 

\begin{remark} 
Note that the Lambert W-function $W(y)$ is a function of slow increase since (see (\ref {E1}) and (\ref {E23}))
\[\lim_{y\rightarrow \infty}\frac{yW'(y)}{W(y)}=\lim_{y\rightarrow \infty}\frac{1}{1+W(y)}=0.\]
\end{remark}

\section{Some Results on Bell Numbers.}  

The limit
\[\lim_{n\rightarrow \infty}\frac{B_n}{n!}	=0.\]
is well-known \cite[p.\ 64]{Knuth9}. In the following Theorem we include it for sake of completeness.

\begin{theorem}
The following limits hold.
\begin{equation}\label{E27}
\lim_{n\rightarrow \infty}\frac{B_n}{a^n}	=\infty \qquad (a>0),
\end{equation}
\begin{equation}\label{E28}
\lim_{n\rightarrow \infty}\frac{B_n}{(n!)^h}	=\infty \qquad (0<h<1),
\end{equation}
\[\lim_{n\rightarrow \infty}\frac{B_n}{n!}	=0.\]
\end{theorem}

\begin{proof}
Equation (\ref {E19}) gives
\[\log\left(\frac{B_n}{a^n}\right)=\log B_n -n \log a = n \log n -n \log a +o(n\log n).\]
Therefore
\[\lim_{n \rightarrow \infty}\log\left(\frac{B_n}{a^n}\right)= \infty,\]
and consequently
\[\lim_{n \rightarrow \infty}\frac{B_n}{a^n}= \infty.\]
That is (\ref {E27}).

The well-known Stirling formula is 
\[n!\sim \sqrt{2\pi} \frac{n^n\sqrt{n}}{e^n}.\]
Therefore
\[\log n!= n \log n -n+\frac{1}{2}\log n +\log \sqrt{2\pi}+o(1)= n \log n-n+o(n),\]
and 
\[\log (n!)^h= h n \log n-hn+o(n).\]
Consequently (see (\ref {E19}))
\begin{equation}\label{E29}
\log \left(\frac{B_n}{(n!)^h}\right)= (1-h)n \log n-n\log\log n -n+hn+o(n).
\end{equation}
If $0<h<1$ equation (\ref {E29}) gives
\[\lim_{n \rightarrow \infty}\log\left(\frac{B_n}{(n!)^h}\right)= \infty.\]
That is,
\[\lim_{n \rightarrow \infty}\frac{B_n}{(n!)^h}= \infty.\]
On the other hand if $h=1$ equation (\ref {E29}) gives
\[\lim_{n \rightarrow \infty}\log\left(\frac{B_n}{n!}\right)= -\infty.\]
That is,
\[\lim_{n \rightarrow \infty}\frac{B_n}{n!}= 0.\]
\end{proof}
 
M. Klazar \cite[Proposition 2.6]{Klazar8} and D. E. Knuth \cite[eq.\ (30),
p.\ 69]{Knuth9} proved the following asymptotic formula
\[\frac{B_{n+1}}{B_n}	\sim \frac{n}{\log n}.\]
This formula is derived as a consequence of the asymptotic formula obtained in the classical paper \cite{Moser11}.

In the following Theorem we derive this formula from the Lov\'asz's formula (\ref {E20}). We also use the well-known properties of the Lambert W-function established in Lemma~\ref{L7}.

\begin{theorem} 
The following asymptotic formula holds,
\begin{equation}\label{E30}
\frac{B_{n+1}}{B_n}	\sim \frac{n}{\log n}.
\end{equation}
\end{theorem}

\begin{proof}
Substituting (\ref {E21}) into (\ref {E20}) we obtain
\[B_n\sim \frac{n^n}{W(n)^{n+\frac{1}{2}}}e^{\frac{n}{W(n)}-n-1}.\]
Consequently
\begin{equation}\label{E31}
\frac{B_{n+1}}{B_n}\sim\frac{n+1}{W(n+1)}\sqrt{\frac{W(n)}{W(n+1)}}\left(\frac{W(n)}{W(n+1)}\right)^{n}e^{\left(\frac{n+1}{W(n+1)}-\frac{n}{W(n)}\right)}.
\end{equation}
Equation (\ref {E22}) gives
\begin{equation}\label{E32}
W(n+1)\sim W(n).
\end{equation}
Equations (\ref {E32}) and (\ref {E22}) give
\begin{equation}\label{E33}
\frac{n+1}{W(n+1)}\sim\frac{n}{\log n}.
\end{equation}
Equation (\ref {E32}) gives
\begin{equation}\label{E34}
\sqrt{\frac{W(n)}{W(n+1)}}\rightarrow 1.
\end{equation}
Let us consider the function $\frac{y}{W(y)}$. The derivative of $\frac{y}{W(y)}$ is (see (\ref {E23}))
\[\frac{W(y)-yW'(y)}{W(y)^2}=\frac{W(y)-\frac{W(y)}{1+W(y)}}{W(y)^2}=\frac{1}{1+W(y)}.\]
Consequently we have (Lagrange's Theorem)
\begin{equation}\label{E35}
\frac{n+1}{W(n+1)}-\frac{n}{W(n)}=\frac{1}{1+W(n+\epsilon(n))}\rightarrow 0,
\end{equation}
where $0<\epsilon(n)<1$. 
 
We have
\begin{equation}\label{E36}
\left(\frac{W(n+1)}{W(n)}\right)^n =\exp \left(n \left(\log W(n+1)-\log W(n)\right)\right).
\end{equation}
Let us consider the function $\log W(y)$. The derivative of $\log W(y)$ is (see (\ref {E23}))
\[\frac{W'(y)}{W(y)}=\frac{1}{y(1+W(y))}.\]
Consequently we have (Lagrange's Theorem)
\begin{eqnarray}\label{E37}
&&n \left(\log W(n+1)-\log W(n)\right)=n \frac{1}{(n+\epsilon(n))(1+W(n+\epsilon(n)))}\nonumber\\&=&
\frac{1}{(1+\frac{\epsilon(n)}{n})(1+W(n+\epsilon(n)))}	\rightarrow 0,
\end{eqnarray}
where $0<\epsilon(n)<1$. 

Equations (\ref {E36}) and (\ref {E37}) give
\begin{equation}\label{E38}
\left(\frac{W(n)}{W(n+1)}\right)^n\rightarrow 1.
\end{equation}
Finally, equations (\ref {E31}), (\ref {E33}), (\ref {E34}), (\ref {E35}) and (\ref {E38}) give (\ref {E30}). 
\end{proof}  

The asymptotic formula (\ref{E30}) implies that the Bell numbers satisfy condition (\ref{E7}). In this case $C=1$, $\alpha =1$, $\beta=-1$ and $f(n)=\log n$. Consequently we have the following Corollary.

\begin{corollary}
The following formulae hold,
\[\lim_{n \rightarrow \infty}\frac{B_{n+1}}{B_n}=\infty,\]
\[(B_{n+1}-B_n)\sim B_{n+1},\]
\[\frac{\sqrt[n]{\frac{B_1}{B_0}\frac{B_2}{B_1}\frac{B_3}{B_2}\cdots \frac{B_n}{B_{n-1}}}}{\frac{B_n}{B_{n-1}}}=\frac{\sqrt[n]{B_n}}{\frac{B_n}{B_{n-1}}}\rightarrow\frac{1}{e},\]
\[B_{n+1}\sim e \ \left(B_n\right)^{1+\frac{1}{n}}.\]
\end{corollary}

\begin{proof}
It is an immediate consequence of Theorem~\ref{T5} and Remark~\ref{R6}.
\end{proof}
  
The following Theorem is well-known \cite[Ex.\ 1(2), p.\ 291]{Comtet4} \cite[Corollary 5 ]{Bouroubi2}. We give a short proof using equation (\ref {E18}).


\begin{theorem} 
The sequence $B_{n+1}-B_n$ is strictly increasing.  
\end{theorem}
 
\begin{proof}
We have (see (\ref {E18}))
\[B_{n+2}-B_{n+1}=\sum^{n}_{k=0}{{n+1}\choose{k}}B_k,
\qquad B_{n+1}-B_n=\sum^{n-1}_{k=0}{{n}\choose{k}}B_k.\]
Consequently
\[(B_{n+2}-B_{n+1})-(B_{n+1}-B_n)=\sum^{n-1}_{k=1}\left({{n+1}\choose{k}}-{{n}\choose{k}}\right)B_k +(n+1)B_n>0,\]
since
\[{{n+1}\choose{k}}>{{n}\choose{k}}\qquad (k=1,\ldots,n).\]
\end{proof}
 
In closing the article we give one more property of the Bell numbers but before prove the following general statement.

\begin{theorem} 
Let $F_n$ be a strictly increasing sequence of positive integers such that
\[\log F_n \sim C n \log n \qquad (C>0).\]
Let $\omega(x)$ be the number of $F_n$ that do not exceed $x$. The following asymptotic formula holds.
\[\omega(x)\sim \frac{\log x}{C \log\log x}.\]
\end{theorem}
  
\begin{proof}
Let $\alpha_n$ be a strictly increasing sequence of positive numbers and let $\alpha(x)$ be the number of $\alpha_n$ that do not exceed $x$. It is well-known \cite[p.\ 129]{Chandra3} that
\[\alpha_n \sim C n \log n \Leftrightarrow \alpha(x)\sim \frac{x}{C \log x}.\]
Now,
\[F_n\leq x\Leftrightarrow \alpha_n=\log F_n\leq \log x.\]
Consequently
\[\omega(x)=\alpha (\log x)\sim \frac{\log x}{C \log\log x}.\]
\end{proof}
 
\begin{example} 
If $F_n=B_n$ is the $n$-th Bell number and $\omega(x)$ is the number of Bell numbers that do not exceed $x$ then (see (\ref {E19}))
\[\omega(x)\sim \frac{\log x}{ \log\log x}.\]
\end{example}

 

\section{Acknowledgements} The author would like to thank  the anonymous referees for their valuable comments and suggestions for improving the original version of this manuscript.
The author is also very grateful to Universidad Nacional de Luj\'an.

\begin{thebibliography}{99}
 
\bibitem{Andrews1}
G. E. Andrews, \textit{The Theory of Partitions}, Cambridge University Press, 1984.

\bibitem{Bouroubi2}
S. Bouroubi, Bell numbers and Engel's conjecture, \textit{Rostock. Math. Kolloq.} \textbf{62} (2007), 61--70.
 
\bibitem{Chandra3}  
K. Chandrasekharan, \textit{Introduction to Analytic Number Theory}, Springer, 1968.

\bibitem{Comtet4}
L. Comtet, \textit{Advances Combinatorics}, D. Reidel Publishing Company, 1974.

\bibitem{Corless5}
R. M. Corless, G. H. Gonnet, D. E. G. Hare, D. J. Jeffrey, and D. E. Knuth, On the Lambert W function, \textit{Adv. Comput. Math.} \textbf{5} (1996), 329--359.

\bibitem{Bruijn6}
N. G. de Bruijn, \textit{Asymptotic Methods in Analysis,} Dover, 1981.
   
\bibitem{Jakim7}
R. Jakimczuk, Functions of slow increase and integer sequences,
\textit{J. Integer Seq.} \textbf{13} (2010), 
\href{http://www.cs.uwaterloo.ca/journals/JIS/VOL13/Jakimczuk/jakimczuk8.html}{Article 10.1.1}.

\bibitem{Klazar8} M. Klazar, Counting set systems by weight,
\textit{Electron. J. Combin.} \textbf{12} (2005), \# R11.

\bibitem{Knuth9}
D. E. Knuth,\textit{ The Art of Computer Programming,} Volume 4, Fascicle 3, Pearson Education, 2005.  

\bibitem{Lovasz10}
L. Lov\'asz,  \textit{Combinatorial Problems and Excercises}, Second Edition, AMS Chelsea Publishing, 2007.
 
\bibitem{Moser11}
L. Moser and M. Wyman, An asymptotic formula for the Bell numbers,
\textit{Trans. Roy. Soc. Canada} \textbf{49} (1955), 49--53.

\bibitem{ReyPastor12}
J. Rey Pastor, P. Pi Calleja, and C. Trejo, \textit{An\'alisis
Matem\'atico,} Volumen I, Octava Edici\'on, Editorial Kapelusz, 1969.

\end{thebibliography}

\bigskip
\hrule
\bigskip

\noindent 2000 {\it Mathematics Subject Classification}:
Primary 11B99; Secondary 11B73.

\noindent \emph{Keywords: } 
functions of slow increase, integer sequences, Bell numbers.

\bigskip
\hrule
\bigskip

\noindent (Concerned with sequence
\seqnum{A000110}.)

\bigskip
\hrule
\bigskip

\vspace*{+.1in}
\noindent
Received December 9 2010;
revised versions received March 28 2011; May 4 2011.
Published in {\it Journal of Integer Sequences}, May 10 2011.

\bigskip
\hrule
\bigskip

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

\end{document}