122452

Appears in sequences

• 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,n-2)/n.at n=20A019579
• a(n) = n*(n - 1)^3/2.at n=23A019582
• Coefficient of x^5 in (1-x-x^2)^(-n).at n=21A139798
• Number of ways to place 2 nonattacking nightriders on an n X n cylindrical board.at n=22A196810
• Number of length n+2 0..5 arrays with the sum of the maximum minus twice the median plus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=4A251425
• T(n,k)=Number of length n+2 0..k arrays with the sum of the maximum minus twice the median plus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=40A251428
• Number of length 5+2 0..n arrays with the sum of the maximum minus twice the median plus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=4A251432
• Numbers k such that k - A224787(k) is a square.at n=36A386623