%I #13 Nov 29 2023 11:42:07
%S 0,1,1,2,4,10,27,90,366
%N Connected simple marginal independence graphs (SMIGs) on n nodes having a unique directed acyclic subgraph.
%H J. Textor, A. Idelberger, and M. Liskiewicz, <a href="https://arxiv.org/abs/1508.00280">Learning from Pairwise Marginal Independencies</a>, arXiv:1508.00280 [cs.AI], 2015.
%Y Cf. A001349, A007776.
%K nonn,more
%O 2,4
%A _N. J. A. Sloane_, Feb 11 2016