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 (list; graph; refs; listen; history; internal format)
OFFSET

4,2

CROSSREFS

Cf. A019576.

Sequence in context: A014901 A000564 A178352 * A177109 A162806 A084329

Adjacent sequences:  A019577 A019578 A019579 * A019581 A019582 A019583

KEYWORD

nonn

AUTHOR

Lee Corbin (lcorbin(AT)tsoft.com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 02:30 EST 2012. Contains 205860 sequences.