6174000

Appears in sequences

• Triangle read by rows: T(n,k) = (-1)^k * n! * 2^(n-2*k) * binomial(n,k) * binomial(2*k,k) (0<=k<=n).at n=32A123516
• Expansion of 140*x*(1 + 4*x + x^2) / (1 - x)^5.at n=19A317984
• Triangle read by rows: T(n,k) = n^3*k^3*(n+k)^2, n>=0, 0 <= k <= n.at n=33A358294
• Triangle read by rows: T(n,k) = n^3*k^3*(n+k)^2, n>=1, 1 <= k <= n.at n=25A358295
• Triangle read by rows: n-th row polynomial equals the numerator of the rational function (-1)^n*f(x) * (d/dx)^n (1/f(x)), where f(x) = sqrt(x + x^2).at n=31A368235
• a(n) is the least number that has exactly n exponential abundant divisors.at n=23A389299
• a(n) is the least exponential deficient number that has exactly n exponential abundant divisors.at n=23A389300
• Irregular triangular array read by rows: T(n,k) is the number of compatible pairs (f,g) of functions from [n] into [n] such that the integer partition induced by f and g is the k-th partition in the canonical (reverse lexicographic) ordering of the partitions, n>=0, 1<=k<=A000041(n).at n=36A390121