Log-balanced combinatorial sequences

Tomislav Došlic
2005 International Journal of Mathematics and Mathematical Sciences  
We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions for log-balancedness are given for the case when the sequence satisfies a two- (or more-) term linear recurrence. It is shown that many combinatorially interesting sequences belong to this class, and, as a consequence, that the above-mentioned double
more » ... d double inequalities are valid for all of them.
doi:10.1155/ijmms.2005.507 fatcat:s2aefgk2onetbdjxqao3o5xrre