login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A180290
Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to 10.
1
10, 110, 792, 4732, 25480, 128520, 620160, 2899248, 13238478, 59366450, 262462010, 1147168890, 4967384268, 21343050399, 91106371800, 386747415000, 1633923070650, 6874432183125, 28818381635736, 120425375772240, 501810628742380, 2085780218807405, 8650033511799424
OFFSET
10,1
LINKS
Alois P. Heinz, Table of n, a(n) for n = 10..1665 (terms n=10..59 from R. H. Hardin)
MAPLE
b:= proc(n, i, k) option remember; `if`(n=0, 1,
`if`(i=0, 0, add(b(n-j, i-1, k), j=0..min(n, k))))
end:
a:= n-> (k-> b(n$2, k)-b(n$2, k-1))(10):
seq(a(n), n=10..35); # Alois P. Heinz, Aug 17 2018
CROSSREFS
Column 10 of A180281.
Sequence in context: A044723 A158492 A249845 * A110251 A270243 A276387
KEYWORD
nonn
AUTHOR
R. H. Hardin, Aug 24 2010
STATUS
approved