16329600

Appears in sequences

• Lah numbers: a(n) = (n-1)*n!/2.at n=8A001286
• Triangle of Lah numbers.at n=46A008297
• Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).at n=53A019538
• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*10^j.at n=30A038264
• T(n, k) = Sum_{j=0..n-k} (-1)^j*binomial(n - k + 1, j)*(n - k + 1 - j)^n. Triangle read by rows, T(n, k) for 1 <= k <= n.at n=46A090582
• Triangle read by rows: T(n,k) = binomial(n,k)*(n-1)!/(k-1)!.at n=46A105278
• Number of surjections from an n-element set to a nine-element set.at n=1A133360
• Triangular sequence of coefficients from the Laplace transform of a Bernoulli expansion function: LaplaceTransform[t*Exp[x*t]/(Exp[t] - 1), t, 1/t] =Zeta[2,1+1/t-x] -> shifted to Zeta[3,1+1/t-x].at n=46A137497
• Coefficient triangle of the numerators of the (n-th convergents to) the continued fraction w/(1 + w/(2 + w/(3 + w/(...)))).at n=43A180047
• a(n) = (n+2)! * Sum_{k = 1..n} 1/((k+1)*(k+2)).at n=9A180119
• Triangular array read by rows: T(n,k) is the number of inversion pairs ( p(i) < p(j) with i>j ) that are separated by exactly k elements in all n-permutations (where the permutation is represented in one line notation); n>=2, 0<=k<=n-2.at n=36A202363
• Size of the equivalence class of S_n containing the identity permutation under transformations of positionally adjacent elements of the form abc <--> acb <--> cba where a<b<c.at n=11A212418
• Triangle with entry a(n,m) giving the total number of necklaces of n beads (C_n symmetry) with n colors available for each bead, but only m distinct colors present, with m from {1, 2, ..., n} and n >= 1.at n=53A213935
• Array of coefficients of numerator polynomials (divided by x) of the n-th approximation of the continued fraction x/(1+x/(2+x/(3+...at n=31A221913
• Table: T(n,k) = n!*binomial(n+1,2*k).at n=30A228955
• Table: T(n,k) = n!*binomial(n+1,2*k).at n=33A228955
• Numbers k for which k = sigma(sigma(x)) = sigma(sigma(y)) for some x and y such that k = x + y.at n=15A229953
• Sum of the cumulative sums of all the permutations of divisors of number n.at n=39A246916
• Triangular array: T(n,k) is the 2-row creation rook number to place k rooks on a 3 x n board.at n=53A267849
• T(n, k) = binomial(n-k-1, k-1)*(n-k)!/k! for n >= 0 and 0 <= k <= floor(n/2). Irregular triangle read by rows.at n=44A330609