416990763

Appears in sequences

• Number of n-node labeled acyclic digraphs with 2 out-points.at n=5A003026
• Triangle read by rows: T(n,k) = number of labeled acyclic digraphs with n nodes, containing exactly n+1-k points of in-degree zero (n >= 1, 1<=k<=n).at n=26A058876
• Triangular array read by rows. T(n,k) is the number of labeled directed acyclic graphs on [n] with exactly k nodes of indegree 0.at n=30A361718