Number of ways to choose a stable partition of a connected antichain of sets spanning n vertices.
A322065
Number of ways to choose a stable partition of a connected antichain of sets spanning n vertices.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =11a(4) =525a(5) =146513a(6) =844334237
External references
- oeis: A322065