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 triangle of numbers f(n,k)/n.
A019576
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 triangle of numbers f(n,k)/n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =6a(5) =1a(6) =6a(7) =45a(8) =12a(9) =1a(10) =24a(11) =420a(12) =160a(13) =20a(14) =1a(15) =120a(16) =4800a(17) =2450a(18) =375a(19) =30a(20) =1a(21) =720a(22) =65520a(23) =43050a(24) =7560a(25) =756a(26) =42a(27) =1a(28) =5040a(29) =1045170
External references
- oeis: A019576