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).

A019581

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).

Terms

    a(0) =0a(1) =2a(2) =18a(3) =180a(4) =2100a(5) =28800a(6) =458640a(7) =8361360a(8) =172141200a(9) =3954484800a(10) =100330876800

External references