login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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
N. J. A. Sloane, Transforms
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 20:47 EDT 2024. Contains 371767 sequences. (Running on oeis4.)