1540944

Appears in sequences

• Number of unlabeled simple digraphs with n nodes.at n=6A000273
• Number of n-dimensional space groups in largest crystal class.at n=5A005031
• a(n) = 12*a(n-1) - 30*a(n-2) with a(0)=1 and a(1)=6.at n=7A145301
• Irregular triangle read by rows: T(n,k) is the number of colored digraphs on n nodes with color scheme given by the partitions of n in canonical ordering.at n=19A328773
• Triangle read by rows: T(n,k) is the number of colored digraphs on n nodes with exactly k colors assigned in a fix order according the node count (1 <= k <= n).at n=15A329541
• Triangle read by rows: T(n,k) is the number of colored digraphs on n nodes with exactly k colors arbitrarily assigned (1 <= k <= n).at n=15A329546
• Array read by antidiagonals: A(n,k) = number of digraphs on n unlabeled nodes, arbitrarily colored with k given colors (n >= 1, k >= 1).at n=20A329874
• Regular subtriangle of A328773: T(n,k) is the number of the balanced colored digraphs on n nodes with k colors, 1 <= k <= n.at n=15A330693
• Triangle read by rows: T(n,k) is the number of binary relations on a set of n objects, exactly k of which are self referencing, 0 <= k <= n.at n=21A384105
• Triangle read by rows: T(n,k) is the number of binary relations on a set of n objects, exactly k of which are self referencing, 0 <= k <= n.at n=27A384105