login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A019579 Place n distinguishable balls in n boxes (in n^n ways); let f(n,k) = number of ways that max in any box is k, for 1<=k<=n; sequence gives f(n,n-2)/n. 1
2, 45, 160, 375, 756, 1372, 2304, 3645, 5500, 7986, 11232, 15379, 20580, 27000, 34816, 44217, 55404, 68590, 84000, 101871, 122452, 146004, 172800, 203125, 237276, 275562, 318304, 365835, 418500, 476656, 540672, 610929, 687820, 771750, 863136, 962407 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,1

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 3..1000

Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

FORMULA

a(n) = n(n-1)^3/2, n >= 5.

G.f.: -x^3*(9*x^6-35*x^5+41*x^4+5*x^3-45*x^2+35*x+2) / (x-1)^5. [Colin Barker, Jan 11 2013]

MATHEMATICA

CoefficientList[Series[-(9 x^6 - 35 x^5 + 41 x^4 + 5 x^3 - 45 x^2 + 35 x + 2)/(x - 1)^5, {x, 0, 50}], x] (* Vincenzo Librandi, Oct 16 2013 *)

CROSSREFS

Cf. A019576.

Sequence in context: A304955 A316637 A281661 * A302220 A302666 A304693

Adjacent sequences:  A019576 A019577 A019578 * A019580 A019581 A019582

KEYWORD

nonn,easy

AUTHOR

Lee Corbin (lcorbin(AT)tsoft.com), N. J. A. Sloane.

EXTENSIONS

More terms from Vincenzo Librandi, Oct 16 2013

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 15 16:13 EDT 2019. Contains 324142 sequences. (Running on oeis4.)