140160

Appears in sequences

• Number of words of length 2n in the 6 transpositions of S[ 4 ] equivalent to the identity.at n=3A029697
• Number of permutations of 1..n with no adjacent pair summing to n+1.at n=9A173841
• Number of permutations of 1..n with no adjacent pair summing to n+2.at n=9A173842
• Number of permutations of [n] containing exactly five occurrences of the consecutive pattern 132.at n=1A263889
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any horizontal, vertical or antidiagonal neighbor equal to n-1.at n=44A266158
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any horizontal, vertical, diagonal or antidiagonal neighbor equal to n-1.at n=44A266208
• a(n) = Sum_{k=0..n} 2^k * binomial(k+2,2) * binomial(k,n-k)^2.at n=7A391676