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-9
1

%I #4 Mar 31 2012 12:35:46

%S 1,25652,461175,1740024,3907995,7391475,13058840,22225256,36773397,

%T 59366450,93736500,145044900,220330110,329064450,483841800,701220000,

%U 1002744600,1416183912,1977008880,2730155120,3732108600,5053360840

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

%H R. H. Hardin, <a href="/A180299/b180299.txt">Table of n, a(n) for n=10..59</a>

%F Empirical: a(n)=n*binomial(n+7,n-2) for n>18

%Y n-9th entry in rows of A180281

%K nonn

%O 10,2

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