
doi: 10.37236/329
In this paper, we give the sufficient conditions for the positivity of recurrence sequences defined by $$a_nu_{n}=b_nu_{n-1}-c_nu_{n-2}$$ for $n\geqslant 2$, where $a_n,b_n,c_n$ are all nonnegative and linear in $n$. As applications, we show the positivity of many famous combinatorial sequences.
recursions, special functions, log concave sequences, positive sequences, Recurrences, lattice walks, log convex sequences, Combinatorial inequalities
recursions, special functions, log concave sequences, positive sequences, Recurrences, lattice walks, log convex sequences, Combinatorial inequalities
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
