|
%I #15 Aug 17 2018 13:45:50
%S 10,110,792,4732,25480,128520,620160,2899248,13238478,59366450,
%T 262462010,1147168890,4967384268,21343050399,91106371800,386747415000,
%U 1633923070650,6874432183125,28818381635736,120425375772240,501810628742380,2085780218807405,8650033511799424
%N Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to 10.
%H Alois P. Heinz, <a href="/A180290/b180290.txt">Table of n, a(n) for n = 10..1665</a> (terms n=10..59 from R. H. Hardin)
%p b:= proc(n, i, k) option remember; `if`(n=0, 1,
%p `if`(i=0, 0, add(b(n-j, i-1, k), j=0..min(n, k))))
%p end:
%p a:= n-> (k-> b(n$2, k)-b(n$2, k-1))(10):
%p seq(a(n), n=10..35); # _Alois P. Heinz_, Aug 17 2018
%Y Column 10 of A180281.
%K nonn
%O 10,1
%A _R. H. Hardin_, Aug 24 2010
|
