A058800 -id:A058800 - cp's OEIS frontend

A058801 Number of connected vertically indecomposable partial lattices on n unlabeled nodes.

1, 2, 6, 25, 116, 625, 3757, 25140, 184511, 1473861, 12711339, 117598686, 1160399052, 12152333659, 134487937252, 1566878426731, 19154490559458

Offset: 2

Christian G. Bower, Dec 28 2000

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.

N. J. A. Sloane, Transforms

Cf. A006966.

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 *)

Inverse EULER transform of A058800(n+2).

a(17)-a(18) (computed from A058800) from Jean-François Alcover, May 10 2019

A058802 Vertically decomposable lattices on n unlabeled nodes.

Original entry on oeis.org

1, 1, 3, 8, 26, 96, 414, 2040, 11432, 72022, 503973, 3875329, 32429747, 292872455, 2834089224, 29209213572, 318979706486

Offset: 3

Christian G. Bower, Dec 28 2000

J. Heitzig and J. Reinhold, Counting finite lattices, preprint no. 298, Institut für Mathematik, Universität Hanover, Germany, 1999.
J. Heitzig and J. Reinhold, Counting finite lattices, Algebra Universalis, 48 (2002), 43-53.

Cf. A006966, A058800.

a(n) = A006966(n) - A058800(n).

cp's OEIS Frontend

A058801 Number of connected vertically indecomposable partial lattices on n unlabeled nodes.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

Extensions