Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058801
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058801 Number of connected vertically indecomposable partial lattices on n unlabeled nodes. +0
1
1, 2, 6, 25, 116, 625, 3757, 25140, 184511, 1473861, 12711339, 117598686, 1160399052, 12152333659, 134487937252 (list; graph; listen)
OFFSET

2,2

COMMENT

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

CROSSREFS

Cf. A006966.

Sequence in context: A003454 A014277 A006965 this_sequence A074010 A030806 A030828

Adjacent sequences: A058798 A058799 A058800 this_sequence A058802 A058803 A058804

KEYWORD

nonn,hard

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Dec 28 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research