Linear and nonlinear inequalities concerning a certain combinatorial sequence which arises from counting the number of chains of a finite distributive lattice
Let , , be the number of chains (totally ordered sets) of length i contained in a finite distributive lattice L of rank n, and set . We study the sequence defined by the formula .
