8488962

Appears in sequences

• Number of labeled graphs with 2-colored nodes where black nodes are only connected to white nodes and vice versa.at n=8A047863
• Array read by antidiagonals: T(n,k) is the number of graphs on n labeled nodes, each node being colored with one of k colors, where no edge connects two nodes of the same color.at n=63A322280
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} k^(j*(n-j)) * binomial(n,j).at n=63A355395
• Array read by antidiagonals: T(n,k) = n! * Sum_{s} 2^(Sum_{i=1..k-1} s(i)*s(i+1))/(Product_{i=1..k} s(i)!) where the sum is over all nonnegative compositions s of n into k parts.at n=63A361950