4420900

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=53A156139
• Total number of adjacent node merge operations to turn a circular list of size n to a node.at n=9A309490