login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


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

%I #8 Aug 17 2018 14:05:02

%S 1,140,735,1652,2970,4950,7865,12012,17745,25480,35700,48960,65892,

%T 87210,113715,146300,185955,233772,290950,358800,438750,532350,641277,

%U 767340,912485,1078800,1268520,1484032,1727880,2002770,2311575,2657340,3043287

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

%H R. H. Hardin, <a href="/A180294/b180294.txt">Table of n, a(n) for n=5..59</a>

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

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

%K nonn

%O 5,2

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 06:15 EDT 2024. Contains 376097 sequences. (Running on oeis4.)