|
Search: id:A019579
|
|
|
| A019579 |
|
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,n-2)/n. |
|
+0
1
|
|
| 2, 45, 160, 375, 756, 1372, 2304, 3645, 5500, 7986, 11232, 15379, 20580, 27000, 34816, 44217, 55404, 68590, 84000, 101871, 122452, 146004, 172800, 203125, 237276, 275562, 318304, 365835
(list; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
