|
Search: id:A006531
|
|
|
| A006531 |
|
Semiorders on n elements.
(Formerly M3061)
|
|
+0
5
|
|
| 1, 1, 3, 19, 183, 2371, 38703, 763099, 17648823, 468603091, 14050842303, 469643495179, 17315795469063, 698171064855811, 30561156525545103, 1443380517590979259, 73161586346500098903, 3961555049961803092531
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Labeled semiorders on n elements: (1+3) and (2+2)-free posets. - Detlef Pauly (dettodet(AT)yahoo.de), Dec 27 2002
|
|
REFERENCES
|
J. L. Chandon, J. LeMaire and J. Pouget, Denombrement des quasi-ordres sur un ensemble fini, Math. Sci. Humaines, No. 62 (1978), 61-80.
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Problem 6.30.
|
|
LINKS
|
Julie Christophe, Jean-Paul Doignon and Samuel Fiorini, Counting Biorders, J. Integer Seqs., Vol. 6, 2003.
|
|
FORMULA
|
E.g.f.: C(1-exp(-x)), where C(x) = (1 - sqrt(1 - 4*x)) / (2*x) is the e.g.f. for the Catalan numbers A000108.
a(n) = sum( S(n, k) * k! * M(k-1), k=1..n), S(n, k): Stirling number of the second kind, M(n): Motzkin number, A001006. - Detlef Pauly, Jun 06 2002
|
|
MAPLE
|
A006531 := n->add(stirling2(n, k)*k!*A001006(k-1), k=1..n);
|
|
CROSSREFS
|
Cf. A000108 (unlabeled semiorders: Catalan numbers).
Adjacent sequences: A006528 A006529 A006530 this_sequence A006532 A006533 A006534
Sequence in context: A045531 A129481 A121083 this_sequence A143633 A052888 A141623
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
