login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006251 Number of n-element posets which are unions of 2 chains.
(Formerly M1216)
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, 27051804890638, 102287657120454, 387558371409606, 1471212825012499, 5594771416613721 (list; graph; refs; listen; history; internal format)
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)).

MATHEMATICA

CoefficientList[Series[4/(2-2x+Sqrt[1-4x]+Sqrt[1-4x^2]), {x, 0, 40}], x] (* From Harvey P. Dale, May 12 2011 *)

PROG

(Pari) x='x+O('x^44) /* that many terms */

gf=4/(2-2*x+sqrt(1-4*x)+sqrt(1-4*x^2));

Vec(gf) /* show terms */ /* Joerg Arndt, Apr 20 2011 */

CROSSREFS

Sequence in context: A049143 A089404 A006123 * A049401 A148099 A007579

Adjacent sequences:  A006248 A006249 A006250 * 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 01:56 EST 2012. Contains 205860 sequences.