Number of triangle-free acyclic digraphs (or DAGs) up to isomorphism with n vertices, maximum indegree 2 and unique maximal element.
A308634
Number of triangle-free acyclic digraphs (or DAGs) up to isomorphism with n vertices, maximum indegree 2 and unique maximal element.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =5a(4) =18a(5) =81a(6) =475a(7) =3394a(8) =29140a(9) =293198
External references
- oeis: A308634