Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001927
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001927 Number of connected partially ordered sets with n labeled points.
(Formerly M2043 N0809)
+0
5
1, 1, 2, 12, 146, 3060, 101642, 5106612, 377403266, 40299722580, 6138497261882, 1320327172853172, 397571105288091506, 166330355795371103700, 96036130723851671469482, 76070282980382554147600692, 82226869197428315925408327266 (list; graph; listen)
OFFSET

0,3

REFERENCES

K. K.-H. Butler and G. Markowsky, Enumeration of finite topologies, Proc. 4th S-E Conf. Combin., Graph Theory, Computing, Congress. Numer. 8 (1973), 169-184.

M. Erne', Struktur- und Anzahlformeln fuer Topologien auf Endlichen Mengen, Manuscripta Math., 11 (1974), 221-259.

M. Erne' and K. Stege, Counting Finite Posets and Topologies, Order, 8 (1991), 247-265.

LINKS

Index entries for sequences related to posets

FORMULA

E.g.f. A(x)=log(B(x)) where B(x) is e.g.f. of A001035.

CROSSREFS

Cf. A000112, A001035, A000608, A066303.

Sequence in context: A035049 A010790 A086928 this_sequence A105558 A126777 A126345

Adjacent sequences: A001924 A001925 A001926 this_sequence A001928 A001929 A001930

KEYWORD

nonn,nice,hard

AUTHOR

njas

EXTENSIONS

More terms from Christian G. Bower (bowerc(AT)usa.net), Dec 12 2001

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 September 6 15:39 EDT 2008. Contains 143480 sequences.


AT&T Labs Research