278323200

Appears in sequences

• Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} for which the number of j < ceiling(n/2) such that p(j) + p(n+1-j) = n+1 is equal to k (n>=1; 0<=k <=ceiling(n/2)).at n=47A155517
• Number of permutations p of {1,2,...,n} such that p(j) + p(n+1-j) != n+1 for all j.at n=12A155518
• Number of permutations p of 1,2,...,n satisfying |p(i+6)-p(i)|<>6 for all 1<=i<=n-6.at n=11A189271
• Number of ways to place n nonattacking composite pieces rook + rider[6,6] on an n X n chessboard.at n=11A189842
• a(0)=1, a(1)=0, a(n) = 4*n*(n-1)*(a(n-1) + 2*(n-1)*a(n-2)).at n=6A189849