1008000

Appears in sequences

• Bishops on an n X n board (see Robinson paper for details).at n=17A005633
• Theta series of lattice D3 tensor D3 (dimension 9, det. 4096, min. norm 4).at n=35A033693
• Expansion of e.g.f. 1/((1-x)^2*(1-x^2)).at n=8A052618
• Number of ordered factorizations of the identity permutation in the symmetric group S_n into 2n-2 transpositions such that the factors generate S_n.at n=3A060902
• a(n) = (3*n + 1)*n!.at n=8A082033
• Table (by antidiagonals) of permutations of two types of objects such that each cycle contains at least one object of each type. Each type of object is labeled from its own label set.at n=40A091441
• a(n)=2a(n-1) but when sum of digits of 2a(n-1) is greater than 9 take a(n) = largest number < 2a(n-1) which has sum of digits = 9.at n=20A140134
• Triangular array: rows are the f-vectors of simplicial complexes dual to permutohedra of type D_n.at n=32A145902
• Triangle read by rows: T(n,k) is the number of permutations of [n] for which k is the maximal number of initial entries whose parities alternate (1 <= k <= n).at n=46A152660
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} for which k is the maximal number of initial odd entries (0 <= k <= ceiling(n/2)).at n=36A152662
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} for which k is the maximal number of initial even entries (0 <= k <= floor(n/2)).at n=30A152664
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} with maximal number of initial entries of the same parity equal to k (1 <= k <= ceiling(n/2)).at n=26A152878
• Number of labeled rooted identity trees on n nodes (rooted trees that admit n! labelings).at n=8A228159