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

A019578

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

Terms

    a(0) =1a(1) =12a(2) =160a(3) =2450a(4) =43050a(5) =858480a(6) =19208000a(7) =477237600a(8) =13049190000a(9) =389642022000

External references