|
Search: id:A006251
|
|
|
| A006251 |
|
Number of n-element posets which are unions of 2 chains.
(Formerly M1216)
|
|
+0
2
|
|
| 1, 1, 2, 4, 10, 26, 75, 225, 711, 2311, 7725, 26313, 91141, 319749, 1134234, 4060128, 14648614, 53208998, 194423568, 714130372, 2635256408, 9764995800, 36320086418, 135548135854, 507434502474, 1904982684106, 7170113287574
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
Problem 6342, Amer. Math. Monthly, 88 (1981), 294.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Problem 6.45.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..200
Index entries for sequences related to posets
|
|
FORMULA
|
G.f.: 4/(2-2*x+sqrt(1-4*x)+sqrt(1-4*x^2)).
|
|
CROSSREFS
|
Sequence in context: A049143 A089404 A006123 this_sequence A049401 A148099 A007579
Adjacent sequences: A006248 A006249 A006250 this_sequence A006252 A006253 A006254
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Aug 21 2000
|
|
|
Search completed in 0.002 seconds
|
