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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A019580 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,4)/n. 0
1, 20, 375, 7560, 167825, 4110120, 110602800, 3252075750, 103881924300, 3585467886000, 133052005386300, 5284678706307000, 223761183682286250, 10063370411081988000, 479152851159102120000, 24082014064135799772000 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,2

LINKS

Table of n, a(n) for n=4..19.

CROSSREFS

Cf. A019576.

Sequence in context: A000564 A178352 A266736 * A177109 A162806 A084329

Adjacent sequences:  A019577 A019578 A019579 * A019581 A019582 A019583

KEYWORD

nonn

AUTHOR

Lee Corbin (lcorbin(AT)tsoft.com)

EXTENSIONS

More terms from Sean A. Irvine, Mar 27 2019

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 18 07:04 EDT 2019. Contains 324203 sequences. (Running on oeis4.)