|
Search: id:A019576
|
|
|
| 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. |
|
+0
7
|
|
| 1, 1, 1, 2, 6, 1, 6, 45, 12, 1, 24, 420, 160, 20, 1, 120, 4800, 2450, 375, 30, 1, 720, 65520, 43050, 7560, 756, 42, 1, 5040, 1045170, 858480, 167825, 19208, 1372, 56, 1, 40320, 19126800, 19208000, 4110120, 516096, 43008, 2304, 72, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
EXAMPLE
|
1; 1,1; 2,6,1; 6,45,12,1; ...
|
|
CROSSREFS
|
Sequence in context: A129677 A077761 A076039 this_sequence A141906 A136766 A021386
Adjacent sequences: A019573 A019574 A019575 this_sequence A019577 A019578 A019579
|
|
KEYWORD
|
nonn,tabl,easy,nice
|
|
AUTHOR
|
Lee Corbin (lcorbin(AT)tsoft.com)
|
|
|
Search completed in 0.003 seconds
|
