|
%I #13 Aug 17 2018 13:46:47
%S 9,90,605,3432,17745,86632,406980,1860480,8335338,36773397,160286166,
%T 691906090,2963163525,12606797973,53339223410,224614532520,
%U 942028278750,3936923432325,16402410574875,68151368796840,282481941399420,1168338215983320,4822856224887175
%N Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to 9.
%H Alois P. Heinz, <a href="/A180289/b180289.txt">Table of n, a(n) for n = 9..1665</a> (terms n=9..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))(9):
%p seq(a(n), n=9..35); # _Alois P. Heinz_, Aug 17 2018
%Y Column 9 of A180281.
%K nonn
%O 9,1
%A _R. H. Hardin_, Aug 24 2010
|
