login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-10.
1

%I #6 Aug 16 2018 23:50:19

%S 1,73788,1645215,6838832,16011905,30931296,55439448,95585220,

%T 160286166,262462010,420630210,660990330,1020099795,1548293760,

%U 2314026000,3409331640,4956643692,7117231968,10101573944,14182012680,19708107276

%N Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-10.

%H R. H. Hardin, <a href="/A180300/b180300.txt">Table of n, a(n) for n=11..59</a>

%F Empirical: a(n)=n*binomial(n+8,n-2) for n>20.

%Y n-10th entry in rows of A180281.

%K nonn

%O 11,2

%A _R. H. Hardin_, formula from _Robert Gerbicz_ in the Sequence Fans Mailing List, Aug 24 2010