100330876800domain: NAppears in sequencesPlace 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,2).at n=10A019581