318304

Appears in sequences

• Place n distinguishable balls in n boxes (in n^n ways); let f(n,k) = number of ways that max in any box is k, for 1 <= k <= n; sequence gives f(n,n-2)/n.at n=26A019579
• a(n) = n*(n - 1)^3/2.at n=29A019582
• Number of ways to place 2 nonattacking nightriders on an n X n cylindrical board.at n=28A196810