Some counting formulas for finite distributive lattices

In the paper we show that the weighted double skeleton of a finite distributive lattice is a suffcient structure to characterize the lattice numerically. We prove some combinatorial formulas for the number of all elements of a finite distributive lattice with the given weighted double skeleton, all its elements with exactly k lower covers and all its covering pairs. Introducing some simple examples, we show how the formulas work.