199584000

Appears in sequences

• Lah numbers: a(n) = (n-1)*n!/2.at n=9A001286
• Lah numbers: a(n) = n! * binomial(n-1, 3)/4!.at n=7A001755
• a(n) = n! * Fibonacci(n).at n=10A005443
• E.g.f. (1-x)/(1-x-x^4).at n=11A052581
• E.g.f. (1-x^3)/(1-x^2-x^3).at n=11A052607
• Expansion of e.g.f. 5*x/(1-x).at n=11A052648
• Expansion of e.g.f. x^2/((1-x)^2*(1+x)).at n=11A052657
• Nonzero coefficients of the polynomials in the numerator of 1/(1+x^2) and its successive derivatives, starting with the constant term.at n=31A076741
• A coefficient tree from the list partition transform relating A000129, A000142, A000165, A110327, and A110330.at n=34A131980
• Number of surjections from an n-element set to a ten-element set.at n=1A133132
• a(n) = (n+2)! * Sum_{k = 1..n} 1/((k+1)*(k+2)).at n=10A180119
• 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=37A221913
• Number of n-length words w over a 10-ary alphabet {a1,a2,...,a10} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a10) >= 1, where #(w,x) counts the letters x in word w.at n=2A226889
• Table: T(n,k) = n!*binomial(n+1,2*k).at n=36A228955
• Expansion of e.g.f. exp(x^3/(1 - x)).at n=11A293049
• Irregular triangle read by rows: T(n,k) is the number of sets of lists with distinct block sizes (as in A088311(n)) and containing exactly k lists.at n=37A351884
• Irregular triangle read by rows: T(n,k) is the number of sets of lists with distinct block sizes (as in A088311(n)) and containing exactly k lists.at n=38A351884
• Expansion of e.g.f. 1/(1-x^2-3*x^3).at n=10A366957
• a(n) is the least k > 1 such that the factorial base expansion of k*n starts with that of n while the remaining digits are zeros.at n=34A382177
• Triangle read by rows: T(n,k) = Sum_{j=0..2k} (-1)^j * binomial(2k,j) * (k-j)^(2n).at n=26A387597