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-6.
1

%I #6 Aug 17 2018 14:05:33

%S 1,1106,9912,27600,54450,96030,160888,259896,406980,620160,922488,

%T 1343034,1917993,2691920,3719100,5065060,6808230,9041760,11875500,

%U 15438150,19879587,25373376,32119472,40347120,50317960,62329344,76717872

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

%H R. H. Hardin, <a href="/A180296/b180296.txt">Table of n, a(n) for n=7..59</a>

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

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

%K nonn

%O 7,2

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