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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A180298 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-8 1

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

%S 1,8952,128865,440374,948090,1754116,3050775,5116200,8335338,13238478,

%T 20549925,31245500,46621575,68378310,98719335,140470200,197218125,

%U 273475800,374872212,508373712,682538780,907810200,1196848620,1564911744

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

%H R. H. Hardin, <a href="/A180298/b180298.txt">Table of n, a(n) for n=9..59</a>

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

%Y n-8th entry in rows of A180281

%K nonn

%O 9,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 | More | 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 April 25 11:03 EDT 2024. Contains 371967 sequences. (Running on oeis4.)