23136128

Appears in sequences

• The sum over all subsets S of [n] of the squares of the number of permutations with descent set = S.at n=8A060350
• Number of ordered pairs (p,q) of permutations of [n] with equal up-down signatures and p(1)=q(1)=9.at n=0A321065
• A(n,k) is the sum of the k-th powers of the descent set statistics for permutations of [n]; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=63A334622
• Triangular array read by rows. T(n,k) is the number of ordered pairs of n-permutations with exactly k rise/falls or fall/rises, n >= 0, 0 <= k <= max{0,n-1}.at n=29A362745
• Triangular array read by rows. T(n,k) is the number of ordered pairs of n-permutations with exactly k rise/falls or fall/rises, n >= 0, 0 <= k <= max{0,n-1}.at n=36A362745