442089

Appears in sequences

• Triangle T(n,k) = (2*n-k-1)*T(n-1,k-1) + (k+1)*T(n-1,k), with T(n,1) = T(n,n) = 1, 1 <= k <= n, read by rows.at n=43A156139
• Number of partitions of n^2 into parts smaller than n.at n=9A161407
• Number of nX5 0..3 arrays with diagonals and rows unimodal and antidiagonals nondecreasing.at n=2A224278
• T(n,k)=Number of nXk 0..3 arrays with diagonals and rows unimodal and antidiagonals nondecreasing.at n=23A224281
• Number of 3Xn 0..3 arrays with diagonals and rows unimodal and antidiagonals nondecreasing.at n=4A224282
• Total number of adjacent node merge operations to turn a circular list of size n to a node.at n=8A309490