login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A058801
Number of connected vertically indecomposable partial lattices on n unlabeled nodes.
0
1, 2, 6, 25, 116, 625, 3757, 25140, 184511, 1473861, 12711339, 117598686, 1160399052, 12152333659, 134487937252, 1566878426731, 19154490559458
OFFSET
2,2
COMMENTS
A partial lattice is a poset where every pair of points has a unique least upper (greatest lower) bound or has no upper (lower) bound.
LINKS
FORMULA
Inverse EULER transform of A058800(n+2).
MATHEMATICA
A058800 = Cases[Import["https://oeis.org/A058800/b058800.txt", "Table"], {_, _}][[All, 2]];
(* EulerInvTransform is defined in A022562 *)
EulerInvTransform[Drop[A058800, 3]] // Rest (* Jean-François Alcover, May 10 2019, updated Mar 17 2020 *)
CROSSREFS
Cf. A006966.
Sequence in context: A014277 A006965 A202705 * A321720 A358499 A357949
KEYWORD
nonn,hard
AUTHOR
Christian G. Bower, Dec 28 2000
EXTENSIONS
a(17)-a(18) (computed from A058800) from Jean-François Alcover, May 10 2019
STATUS
approved