On Engel's Inequality for Bell Numbers

We prove that for all integers n ≥ 2 the expression Bn−1Bn+1 − B 2 n can be represented as an infinite series with nonnegative terms. Here Bk denotes the k-th Bell number. It follows that the sequence (Bn)n≥0 is strictly log-convex. This result refines Engel’s inequality B n ≤ Bn−1Bn+1.

[1]  Izumi Kubo,et al.  Bell Numbers, Log-Concavity, and Log-Convexity , 2000 .

[2]  S. Bouroubi Bell Numbers and Engel's Conjecture , 2007 .

[3]  Konrad Engel,et al.  On the Average Rank of an Element in a Filter of the Partition Lattice , 1994, J. Comb. Theory, Ser. A.

[4]  N. Sloane The on-line encyclopedia of integer sequences , 2018, Notices of the American Mathematical Society.

[5]  E. Rodney Canfield,et al.  Engel's Inequality for Bell Numbers , 1995, J. Comb. Theory, Ser. A.