3781503

Appears in sequences

• Number of acyclic digraphs (or DAGs) with n labeled nodes.at n=6A003024
• Matrix inverse of A111636.at n=21A224069
• Square array read by descending antidiagonals. T(n,k) is the number of acyclic k-multidigraphs on n labeled vertices, n>=0,k>=0.at n=34A339768
• Square array read by descending antidiagonals. Let G be a simple labeled graph on n nodes. T(n,k) is the number of ways to give G an acyclic orientation and a coloring function C:V(G) -> {1,2,...,k} so that u->v implies C(u) >= C(v) for all u,v in V(G), n >= 0, k >= 0.at n=34A340798
• Triangle read by rows: T(n,k) is the number of simple digraphs on labeled n nodes with k strongly connected components.at n=27A361455
• Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] having exactly k strongly connected components all of which are simple cycles, n >= 0, 0 <= k <= n.at n=27A361527
• Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] with exactly k strongly connected components of size 1, n>=0, 0<=k<=n.at n=27A361592
• Triangular array read by rows. T(n,k) is the number of labeled digraphs (with self loops allowed) on [n] containing exactly k primitive components, n>=0, 0<=k<=n.at n=27A365325
• Triangular array read by rows: T(n,k) is the number of Boolean relation matrices such that all of the blocks of its Frobenius normal form are 0-blocks or 1-blocks and that have exactly k 1-blocks on the diagonal, n>=0, 0<=k<=n.at n=21A366141
• Triangular array read by rows: T(n,k) is the number of Boolean relation matrices such that all of the blocks of its Frobenius normal form are 0-blocks or 1-blocks and that have exactly k 1-blocks on the diagonal, n>=0, 0<=k<=n.at n=27A366141
• Triangular array read by rows. T(n,k) is the number of binary relations on [n] that have exactly k accessible points, n>=0, 0<=k<=n.at n=21A370203
• Triangular array read by rows. T(n,k) is the number of ways to choose a size k subset S of [n] and form a labeled acyclic digraph on S. Then form another labeled acyclic digraph on [n]-S. For each pair u in S and v in [n]-S add the directed edge u->v or not, n>=0, 0<=k<=n.at n=21A380336
• Triangular array read by rows. T(n,k) is the number of ways to choose a size k subset S of [n] and form a labeled acyclic digraph on S. Then form another labeled acyclic digraph on [n]-S. For each pair u in S and v in [n]-S add the directed edge u->v or not, n>=0, 0<=k<=n.at n=27A380336