Number of acyclic digraphs (DAGS) on n labeled nodes, where the indegree and outdegree of each node is at most 1.
A243014
Number of acyclic digraphs (DAGS) on n labeled nodes, where the indegree and outdegree of each node is at most 1.
Terms
- a(0) =1a(1) =1a(2) =3a(3) =13a(4) =61a(5) =321a(6) =1951a(7) =13693a(8) =109593a(9) =986401a(10) =9864091a(11) =108505101a(12) =1302061333a(13) =16926797473a(14) =236975164791
External references
- oeis: A243014