262542

Appears in sequences

• T(n,k) = Sum of multinomial(n; n_1,n_2,...,n_k)^2, where the sum extends over all compositions (n_1,n_2,...,n_k) of n into exactly k nonnegative parts.at n=23A192722
• Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having four, five or six distinct values for every i,j,k<=n.at n=11A211576
• Number of (3+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=14A250771
• Triangular array read by rows. T(n,k) is the number of ways to form an ordered pair of n-permutations and then choose a size k subset of its common descent set, n >= 0, 0 <= k <= max{0,n-1}.at n=26A362589