A268522 Connected simple marginal independence graphs (SMIGs) on n nodes having a unique directed acyclic subgraph.

0, 1, 1, 2, 4, 10, 27, 90, 366

Offset

2,4

Links

Table of n, a(n) for n=2..10.

J. Textor, A. Idelberger, and M. Liskiewicz, Learning from Pairwise Marginal Independencies, arXiv:1508.00280 [cs.AI], 2015.

Crossrefs

Cf. A001349, A007776.

Sequence in context: A057786 A262496 A007776 * A123428 A005975 A048193

Adjacent sequences: A268519 A268520 A268521 * A268523 A268524 A268525

Keyword

nonn,more

Author

N. J. A. Sloane, Feb 11 2016

Status

approved