Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Mar 28 2019 11:24:38
%S 1,12,160,2450,43050,858480,19208000,477237600,13049190000,
%T 389642022000,12620614406400,440871877446000,16525943429595600,
%U 661779275661504000,28199857953915648000,1274233240573028736000,60863881753459328544000
%N 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 Cf. A019576.
%K nonn
%O 3,2
%A Lee Corbin (lcorbin(AT)tsoft.com)
%E More terms from _Sean A. Irvine_, Mar 27 2019