|
Search: id:A019577
|
|
|
| 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. |
|
+0
1
|
|
| 0, 1, 6, 45, 420, 4800, 65520, 1045170, 19126800, 395448480, 9120988800, 232248416400, 6471820555200, 195912193276800, 6402199349145600, 224636583525354000, 8423131243022496000, 336138596955120960000
(list; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
