cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A238752 Number of nonisomorphic partial 1-differential posets up to rank n.

Original entry on oeis.org

1, 1, 1, 1, 2, 5, 35, 643, 44606, 29199636
Offset: 1

Views

Author

William J. Keith, Mar 04 2014

Keywords

Examples

			For n<=4, label nodes with the partitions of n for convenience.
At n=5, the two possible posets are the Young poset (nodes and covering relations are the partitions of 5) and the poset constructed by covering the partitions (31), (22) and (211) with a common element, then giving each of those partitions another cover, and leaving all other nodes the same.