172872000

Appears in sequences

• Place n distinguishable balls in n boxes (in n^n ways); let T(n,k) = number of ways that the maximum in any box is k, for 1 <= k <= n; sequence gives triangle of numbers T(n,k).at n=38A019575
• Number of n X n (0,1)-matrices with two 1's in each row and permanent equal to 8.at n=7A174638