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,2)/n.

A019577

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,2)/n.

Terms

    a(0) =0a(1) =1a(2) =6a(3) =45a(4) =420a(5) =4800a(6) =65520a(7) =1045170a(8) =19126800a(9) =395448480a(10) =9120988800a(11) =232248416400

External references