Log-balanced combinatorial sequences

Roman logarithmic binomial formula analogue has been found . It is presented here also for the case of fibonomial coefficients which recently have been given a combinatorial interpretation by the present author.

We consider the higher order Tur\'an inequality and higher order log-concavity for sequences $\{a_n\}_{n \ge 0}$ such that \[ \frac{a_{n-1}a_{n+1}}{a_n^2} = 1 + \sum_{i=1}^m \frac{r_i(\log n)}{n^{\alpha_i}} + o\left( \frac{1}{n^{\beta}} \right), \] where $m$ is a nonnegative integer, $\alpha_i$ are real numbers, $r_i(x)$ are rational functions of $x$ and \[ 0 < \alpha_1 < \alpha_2 < \cdots < \alpha_m < \beta. \] We will give a sufficient condition on the higher order Tur\'an ...

We pose thirty conjectures on arithmetical sequences, most of which are about monotonicity of sequences of the form $(\root n\of{a_n})_{n\ge 1}$ or the form $(\root{n+1}\of{a_{n+1}}/\root n\of{a_n})_{n\ge1}$, where $(a_n)_{n\ge 1}$ is a number-theoretic or combinatorial sequence of positive integers. This material might stimulate further research.

This paper gives a brief description of the author's database of integer sequences, now over 35 years old, together with a selection of a few of the most interesting sequences in the table. Many unsolved problems are mentioned.

In this paper we develop a new geometric method to answer the log-concavity questions related to a nice class of combinatorial sequences arising from the Pascal triangle.

Let $\mathcal{A}=\left(a_i\right)_{i=1}^\infty$ be a weakly increasing sequence of positive integers and let $k$ be a fixed positive integer. For an arbitrary integer $n$, the restricted partition $p_\mathcal{A}(n,k)$ enumerates all the partitions of $n$ whose parts belong to the multiset $\{a_1,a_2,\ldots,a_k\}$. In this paper we investigate some generalizations of the log-concavity of $p_\mathcal{A}(n,k)$. We deal with both some basic extensions like, for instance, the stro...

This paper describes a method to find a connection between combinatorial identities and hypergeometric series with a number of examples. Combinatorial identities can often be written as hypergeometric series with unit argument. In a number of cases these hypergeometric series are balanced and can be reduced to a simpler form. In this paper some combinatorial identities are proved using this method assuming that the results in the tables of Prudnikov et al. [12] are proven wit...

We present an approach to proving the 2-log-convexity of sequences satisfying three-term recurrence relations. We show that the Apery numbers, the Cohen-Rhin numbers, the Motzkin numbers, the Fine numbers, the Franel numbers of order 3 and 4 and the large Schroder numbers are all 2-log-convex. Numerical evidence suggests that all these sequences are k-log-convex for any $k\geq 1$ possibly except for a constant number of terms at the beginning.

We extend Hoggar's theorem that the sum of two independent discrete-valued log-concave random variables is itself log-concave. We introduce conditions under which the result still holds for dependent variables. We argue that these conditions are natural by giving some applications. Firstly, we use our main theorem to give simple proofs of the log-concavity of the Stirling numbers of the second kind and of the Eulerian numbers. Secondly, we prove results concerning the log-con...

In this paper, we use the Riemann zeta function $\zeta(x)$ and the Bessel zeta function $\zeta_{\mu}(x)$ to study the log-behavior of combinatorial sequences. We prove that $\zeta(x)$ is log-convex for $x>1$. As a consequence, we deduce that the sequence $\{|B_{2n}|/(2n)!\}_{n\geq 1}$ is log-convex, where $B_n$ is the $n$-th Bernoulli number. We introduce the function $\theta(x)=(2\zeta(x)\Gamma(x+1))^{\frac{1}{x}}$, where $\Gamma(x)$ is the gamma function, and we show that $...