64144675

Appears in sequences

• 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=25A058876
• Number of n-node labeled acyclic digraphs with 3 out-points.at n=4A060335
• 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=31A361718