8361360

Appears in sequences

• Place n distinguishable balls in n boxes (in n^n ways); let T(n,k) = number of ways that the maximum in any box is k, for 1 <= k <= n; sequence gives triangle of numbers T(n,k).at n=29A019575
• 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,2).at n=7A019581
• a(n) is the number of partial bijections (or subpermutations) of an n-element set without fixed points (also called partial derangements).at n=9A144085
• T(n,k) is the number of partial bijections (or subpermutations) of an n-element set with exactly k fixed points.at n=45A144088
• Array read by downward antidiagonals: A(n,k) = -A(n-1,k) + (k+1)*A(n-1,k+1) + A(n-1,k+2) with A(0,k) = 1, n >= 0, k >= 0.at n=54A369292