33040

Appears in sequences

• A binomial coefficient sum.at n=8A003161
• Triangle T(n,k), n >= 0, 0 <= k <= n, read by rows: T(n,k) is the number of forests of trees on n or fewer nodes using a subset of labels 1..n and k edges.at n=39A144258
• Number of ways to place 2 nonattacking amazons (superqueens) on an n X n board.at n=16A172200
• Number of (n+2)X(1+2) 0..3 arrays with the (lower) median of each row and column nondecreasing.at n=0A237624
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with the (lower) median of each row and column nondecreasing.at n=0A237625
• Total number A(n,k) of k-tuples of semi-Dyck paths from (0,0) to (n,n-2*j) for j=0..floor(n/2); square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=74A357824
• The binary expansion of a(n) is an initial 1 bit then tracks where the swaps occur in the exchange sort algorithm sorting the binary expansion of n into decreasing order.at n=37A380145
• a(n) = Sum_{k=0..n} A039599(n,k)^3.at n=4A382403