Counting finite lattices.
The authors present a fast orderly algorithm generating all un(labeled) lattices up to a given size \(n\). Using this algorithm, they compute the number \(l(n)\) of all unlabeled lattices having no more than 18 elements. This result also corrects wrong numbers \(l(11)\) and \(l(12)\) by \textit{Y. Koda} [Bull. Inst. Comb. Appl. 10, 83--89 (1994; Zbl 0806.05005)].
scientific article; zbMATH DE number 2158795