|
|
A019580
|
|
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,4)/n.
|
|
0
|
|
|
1, 20, 375, 7560, 167825, 4110120, 110602800, 3252075750, 103881924300, 3585467886000, 133052005386300, 5284678706307000, 223761183682286250, 10063370411081988000, 479152851159102120000, 24082014064135799772000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
4,2
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Lee Corbin (lcorbin(AT)tsoft.com)
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|