139708800

Appears in sequences

• a(n+1) = (n-1)*a(n) + n*n!.at n=9A006157
• a(n) = n!*(n-4)/2.at n=7A034865
• a(n) = n!*(n-4)/2, n > 4, and a(4) = 4.at n=7A034866
• Fifth column sequence of triangle A062139 (generalized a=2 Laguerre).at n=6A062194
• Triangle T(n,k) of associated Lah numbers, n>=2, k=1..floor(n/2).at n=27A076126
• Generalized Stirling2 array (4,2).at n=29A090438
• Fifth column (k=6) of array A090438 ((4,2)-Stirling2).at n=3A091035
• Triangle read by rows: T(m,n) = number of ways of distributing n distinguishable balls into m distinguishable bins of size 2 where empty bins are permitted (m >= 1, 1 <= n <= 2m).at n=52A248844
• Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.at n=36A249253
• Triangle read by rows, T(n,k) = (-1)^k*(2*n)!*P[n,k](n/(n+1)) where P is the P-transform, for n>=0 and 0<=k<=n.at n=25A268438
• E.g.f.: Product_{m>0} (1 + x^(2*m-1) + x^(4*m-2)/2!).at n=11A293488
• Number of words w of length n such that each letter of the denary alphabet is used at least once and for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.at n=2A321846
• Triangle read by rows: T(n, k) = (-1)^k*Product_{j=0..k-1} (j - n)*(j + n), for 0 <= k <= n.at n=33A370707
• Numbers of least prime signature (A025487) whose prime factorization has equal sum of even and odd exponents.at n=23A371600