Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $A$ be a set has $n$ element, my question is how many partial order on it?

For $n=0,1$, $N_P(n)=1$ Case $n=2$, $N_P(n)=3$ Case $n=3$, $N_P(n)=19$

Is there a general formula?


It seems closed formula have not been found yet. But does any generating function be known current?

share|cite|improve this question
up vote 2 down vote accepted

This is the sequence OEIS A001035, the number of partial orders on a labelled $n$-element set; OEIS A000112 gives the number of partial orders on an unlabelled $n$-element set. Neither entry gives a closed formula, a recurrence, or a generating function. Both cite

D. J. Kleitman and B. L. Rothschild, Asymptotic enumeration of partial orders on a finite set, Trans. Amer. Math. Soc., 205 (1975) 205-220

among the references, suggesting that at present all we have are exact results for small $n$ (up to at least $18$ for the labelled case and $16$ for the unlabelled case) and asymptotic results.

share|cite|improve this answer

A001035 doesn't list a closed-form formula.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.