|
Search: id:A019581
|
|
|
| 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). |
|
+0
1
|
|
| 0, 2, 18, 180, 2100, 28800, 458640, 8361360, 172141200, 3954484800, 100330876800, 2786980996800, 84133667217600, 2742770705875200, 96032990237184000, 3594185336405664000, 143193231131382432000
(list; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
