|
| |
|
|
A180281
|
|
T(n,k)=Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to k
|
|
21
|
|
|
|
1, 1, 2, 1, 6, 3, 1, 18, 12, 4, 1, 50, 50, 20, 5, 1, 140, 195, 90, 30, 6, 1, 392, 735, 392, 147, 42, 7, 1, 1106, 2716, 1652, 672, 224, 56, 8, 1, 3138, 9912, 6804, 2970, 1080, 324, 72, 9, 1, 8952, 35850, 27600, 12825, 4950, 1650, 450, 90, 10, 1, 25652, 128865, 110715
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,3
|
|
|
COMMENTS
|
Table starts
1
1 2
1 6 3
1 18 12 4
1 50 50 20 5
1 140 195 90 30 6
|
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n=1..1770
|
|
|
FORMULA
|
Empirical: right half of table, T(n,k)=n*binomial(2*n-k-2,n-2) for 2*k>n.
also T(n,2)=sum{j=1..n}binomial(n,j)*binomial(n-j,j)=2*A097861(n)
|
|
|
CROSSREFS
|
Cf. A097861, A180282.
Sequence in context: A121468 A168151 A213221 * A187888 A092392 A128741
Adjacent sequences: A180278 A180279 A180280 * A180282 A180283 A180284
|
|
|
KEYWORD
|
nonn,tabl
|
|
|
AUTHOR
|
R. H. Hardin, formula from Robert Gerbicz in the Sequence Fans Mailing List, Aug 24 2010
|
|
|
STATUS
|
approved
|
| |
|
|
