113400

Appears in sequences

• a(n) = (2n)!/2^n.at n=5A000680
• a(n) = (5*n)!/(n!)^5.at n=2A008978
• (3n+1)!/(4*(3n-1)).at n=2A028918
• Denominators of Taylor series for exp(x)*sin(x).at n=10A046979
• a(n) = (4n+2)!/2^(2n+1).at n=2A052277
• Saint-Exupéry numbers: ordered products of the three sides of Pythagorean triangles.at n=30A057096
• Square array read by antidiagonals of number of ways of dividing n*k labeled items into n labeled boxes with k items in each box.at n=19A060538
• Number T(n,m) of n X m matrices over {0,1,2} with all row and column sums equal to 1 or 2, m=0,..,2*n.at n=35A062154
• This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of triangular numbers. The p-th row (p>=1) contains a(i,p) for i=1 to 2*p-1, where a(i,p) satisfies Sum_{i=1..n} C(i+1,2)^p = 3 * C(n+2,3) * Sum_{i=1..2*p-1} a(i,p) * C(n-1,i-1)/(i+2).at n=35A087127
• Number of permutations in the symmetric group S_n that have odd number of transpositions in their cycle decomposition.at n=9A088506
• Denominators used in the computation of the column sequences of array A078739 ((2,2)-Stirling2).at n=10A089512
• Table T(n,k), 0<=k, 0<=n, read by antidiagonals, defined by T(n,k) = (k*n)! / (n!)^k.at n=30A089759
• a(n) = n! / 2^floor(n/2).at n=10A090932
• a(n) = n(n-1)(n-3)(n-6)...(n-t), where t is the largest triangular number less than n; number of factors in the product is ceiling((sqrt(1+8*n)-1)/2).at n=14A094261
• Numbers with incrementally smallest ratio A002034(n)/n.at n=51A094371
• Number of meaningfully different ways to design a neutral single-elimination tournament with n teams.at n=9A096351
• Triangle read by rows: T(n,k) is the number of permutations of [n] with exactly k increasing runs of odd length.at n=55A097591
• a(n) = binomial(n+2,2)*binomial(n+5,2).at n=23A105938
• Primal codes of canonical finite permutations on positive integers.at n=12A109299
• Triangle read by rows: a(n, n) = n! and for 1 <= k < n, a(n, k) = Sum_{i=0..n-1} Product_{j=i+1..i+k} f(j, n), where for x <= y, f(x, y) = x and for x > y, f(x, y) = x-y.at n=41A109876