A019578 - cp's OEIS frontend

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.

%I A019578 #6 Mar 28 2019 11:24:38
%S A019578 1,12,160,2450,43050,858480,19208000,477237600,13049190000,
%T A019578 389642022000,12620614406400,440871877446000,16525943429595600,
%U A019578 661779275661504000,28199857953915648000,1274233240573028736000,60863881753459328544000
%N 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.
%Y A019578 Cf. A019576.
%K A019578 nonn
%O A019578 3,2
%A A019578 Lee Corbin (lcorbin(AT)tsoft.com)
%E A019578 More terms from _Sean A. Irvine_, Mar 27 2019

cp's OEIS Frontend

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.