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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A019578 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,3)/n. 0
1, 12, 160, 2450, 43050, 858480, 19208000, 477237600, 13049190000, 389642022000, 12620614406400, 440871877446000, 16525943429595600, 661779275661504000, 28199857953915648000, 1274233240573028736000, 60863881753459328544000 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,2

LINKS

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

CROSSREFS

Cf. A019576.

Sequence in context: A219418 A098400 A208791 * A144346 A167558 A048609

Adjacent sequences:  A019575 A019576 A019577 * A019579 A019580 A019581

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 25 23:52 EDT 2019. Contains 324367 sequences. (Running on oeis4.)