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”).
%I #7 Apr 16 2014 00:24:59
%S 1,18,50,90,147,224,324,450,605,792,1014,1274,1575,1920,2312,2754,
%T 3249,3800,4410,5082,5819,6624,7500,8450,9477,10584,11774,13050,14415,
%U 15872,17424,19074,20825,22680,24642,26714,28899,31200,33620,36162,38829,41624
%N Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-2.
%H R. H. Hardin, <a href="/A180292/b180292.txt">Table of n, a(n) for n=3..59</a>
%F Empirical: a(n)=n*binomial(n,n-2) for n>4.
%Y (n-2)nd entry in rows of A180281.
%K nonn
%O 3,2
%A _R. H. Hardin_, formula from _Robert Gerbicz_ in the Sequence Fans Mailing List, Aug 24 2010