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.

1, 12, 160, 2450, 43050, 858480, 19208000, 477237600, 13049190000, 389642022000, 12620614406400, 440871877446000, 16525943429595600, 661779275661504000, 28199857953915648000, 1274233240573028736000, 60863881753459328544000

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