2689597440

Appears in sequences

• 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=19A329546
• a(n) = n*(n-1)*(n- 2)^2*2^(n-4)/3.at n=19A391778