325061

Appears in sequences

• Number of n X 4 0..4 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=8A200986
• Triangle T(n, k) = T(n, k-1) + (-1)^k*A060187(n+2,k+1) if k <= floor(n/2), otherwise T(n, n-k), with T(n, 0) = T(n, n) = 1, read by rows.at n=30A225356
• Triangle T(n, k) = T(n, k-1) + (-1)^k*A060187(n+2,k+1) if k <= floor(n/2), otherwise T(n, n-k), with T(n, 0) = T(n, n) = 1, read by rows.at n=33A225356