科研之友
微信
新浪微博
Facebook
分享链接
摘要
Recently, Doslic, and Liu and Wang developed techniques for dealing with the log-convexity of sequences. In this paper, we present a criterion for the log-convexity of some combinatorial sequences. In order to prove the log-convexity of a sequence satisfying a three-term recurrence, by our method, it suffices to compute a constant number of terms at the beginning of the sequence. For example, in order to prove the log-convexity of the Apery numbers A n , by our method, we just need to evaluate the values of A(n) for 0 <= n <= 6 . As applications, we prove the log-convexity of some famous sequences including the Catalan-Larcombe-French numbers. This confirms a conjecture given by Sun.
- 出版日期2013-10-14
- 单位江苏大学
