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”).

A180285
Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to 5.
1
5, 30, 147, 672, 2970, 12825, 54450, 228294, 948090, 3907995, 16011905, 65280800, 265055772, 1072443810, 4326290424, 17407489065, 69884197635, 280002750720, 1119913829375, 4472279679846, 17834705765630, 71032337773930, 282586675707180, 1123047360182475
OFFSET
5,1
LINKS
Alois P. Heinz, Table of n, a(n) for n = 5..1687 (terms n=5..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))(5):
seq(a(n), n=5..30); # Alois P. Heinz, Aug 17 2018
CROSSREFS
Column 5 of A180281.
Sequence in context: A359094 A255052 A282086 * A344064 A055298 A104891
KEYWORD
nonn
AUTHOR
R. H. Hardin, Aug 24 2010
STATUS
approved