4838400

Appears in sequences

• a(n) = (n-1)*(n+1)!/6.at n=8A005990
• Number of reversible strings with n labeled beads of 2 colors, no palindromes of more than 1 bead.at n=7A032069
• Triangle T(n,k) of number of minimal 3-covers of a labeled n-set that cover k points of that set uniquely (k=3,..,n).at n=31A057964
• Sum of unitary divisors of central binomial coefficient C(n, floor(n/2)).at n=23A064140
• Triangle whose n-th row contains the n smallest numbers that are products of n distinct integers > 1, read by rows.at n=41A081957
• a(1)=2; a(n)=ceiling(n*(a(n-1)-1/a(n-1))).at n=9A082569
• Generalized Stirling2 array (4,2).at n=17A090438
• A062401(x)=phi[sigma(x)] function is iterated; initial value=2^n; a(n)=smallest term of trajectory.at n=22A097000
• Determinant of n X n matrix M_{i,j} = 2^i*P_i(j), where P_i(j) is the Legendre polynomial of order i at j and i and j are 0-based.at n=4A110131
• a(n) = Product_{k=0..n-1} k!*binomial(2k,k).at n=5A112332
• Number of transitive PSL_2(ZZ) actions on a finite labeled set of size n.at n=8A121355
• Triangle read by rows: T(n,k) = n!*k!, 0 <= k <= n.at n=41A143216
• 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=37A152664
• 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=32A152878
• The n-th derivative of x^10 evaluated at x=2.at n=7A189071
• Table read by rows: The coefficients of the polynomials P(n, x) = Sum_{k=0..n} Sum_{j=0..k} (-1)^j * 2^(-k) * binomial(k, j) * (k-2*j)^n * x^(n-k).at n=57A193474
• Triangle T(n,k) gives the number of ordered partitions of an n set into k odd-sized blocks.at n=52A196776
• a(n) = A203415(n+1)/A203415(n).at n=8A203416
• Number of (n+3)X(2+3) 0..2 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=3A230751
• Number of (n+3)X(4+3) 0..2 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=1A230753