OFFSET
0,2
COMMENTS
a(n) = Sum_{P} d(P)^2 over the A001035(n) labeled posets P on [n], where d(P) is the number of antichains (equivalently order ideals / down-sets) of P. This is the k=2 member of the antichain-count moment family k=1..4 (k=1: A397542) used to compute A001035(19).
a(n) is the number of labeled posets on n+2 elements in which two designated elements are both maximal (with proof: attach to (P, I_1, I_2) a new maximal point above each of the two ideals; two maximal points are automatically incomparable, and the correspondence is a bijection).
LINKS
Rafael Ayala, The number of labeled partial orders and topologies on 19 points, arXiv:2606.31526 [math.CO], 2026.
Rafael Ayala, Code and data for the antichain-count moments
CROSSREFS
KEYWORD
nonn,new
AUTHOR
Rafael Ayala, Jul 09 2026
STATUS
approved
