%I #10 Apr 10 2014 09:14:34
%S 1,50,195,392,672,1080,1650,2420,3432,4732,6370,8400,10880,13872,
%T 17442,21660,26600,32340,38962,46552,55200,65000,76050,88452,102312,
%U 117740,134850,153760,174592,197472,222530,249900,279720,312132,347282,385320
%N Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-3.
%H R. H. Hardin, <a href="/A180293/b180293.txt">Table of n, a(n) for n=4..59</a>
%F Empirical: a(n) = n*binomial(n+1, n-2) for n>6.
%Y (n-3)rd entry in rows of A180281.
%K nonn
%O 4,2
%A _R. H. Hardin_, formula from _Robert Gerbicz_ in the Sequence Fans Mailing List, Aug 24 2010