Does the ordinary generating function of Bell numbers converge? I am working in a field not really based on combinatorics, therefore I appologize if my question is in any kind invalid. Nevertheless, in my calculations, the Bell numbers appeared. I need to find some $x$ such that the ordinary generating function
$$B(x) = \sum_{n=0}^{\infty}B_n x^n$$
converge. I haven't found the answer nowhere in the literature. On the opposite, there are quite a lot of results concerning $B(x)$, but none of them is questioning for which $x$ it has some sense. It is evident that the case $x>1$ lead to a divergent series, which is not much of an interest. But what about $x<1$? I suppose there must be such $x$, otherwise it is nonsense to study such series, is it not?
One other thing suprised me. There is a nice representation in Klazar of $B(x)$ such that
$$B(x) = \sum_{n=0}^{\infty}\frac{x^n}{(1-x)(1-2x)\cdots(1-n x)}.$$
But what if $x$ equals to $1/k$ for some $k$ natural? Would that make the series divergent? I am sorry, but is has been bugging me for some time that there is no explanation in the literature that I have been looking into. Does anyone have some relevant source of information?
Thank you, I would appreciate any help.
 A: The Bell numbers satisfy $\frac{\ln B_n}{n} \sim \ln n$ which is faster than exponential, so the ordinary generating function $\sum B_n x^n$ has zero radius of convergence. As a more elementary argument, Dobinski's formula
$$B_n = \frac{1}{e} \sum_{k \ge 0} \frac{k^n}{k!}$$
establishes that $B_n$ grows at least as fast as $k^n$ for any positive integer $k$, which also implies that $B_n$ grows faster than exponentially and so $\sum B_n x^n$ has zero radius of convergence.
This does not imply that it's nonsense to study this series; formal power series can be studied abstractly and it's common practice to do so in combinatorics. $x$ is just never specialized to a concrete value in $\mathbb{C}$ and we never perform operations that would involve adding infinitely many coefficients. As another example, $\sum n! x^n$ makes sense as a formal power series also despite having zero radius of convergence, and there are various interesting things to say about it, e.g. its logarithm
$$\log \sum n! x^n = x + \frac{3}{2} x^2 + \frac{13}{3} x^3 + \frac{71}{4} x^4 + \dots $$
counts subgroups of the free group $F_2$. There is also a funny continued fraction
$$\sum n! x^n = \frac{1}{1 - x - \frac{x^2}{1 - 3x - \frac{4x^2}{1 - 5x - \frac{9x^2}{1 - 7x - \frac{16x^2}{1 - 9x - \dots}}}}}$$
coming from the fact that $n!$ is the sequence of moments of the exponential distribution. $B_n$ is the sequence of moments of the Poisson distribution with $\lambda = 1$ (this is equivalent to Dobinski's formula) which also gives a continued fraction expansion for $\sum B_n x^n$, namely the second expansion given by Ira Gessel in the comments.
