457228800

Appears in sequences

• a(n) = binomial(n,floor(n/2))*(n+1)!.at n=9A002867
• Bishops on an 8n+1 X 8n+1 board (see Robinson paper for details).at n=5A123072
• A new q-combination type general triangle sequence based on Stirling first polynomials: here q=5: m=4: t(n,k)=If[m == 0, n!, Product[Sum[(-1)^(i + k)*StirlingS1[k - 1, i]*(m + 1)^i, {i, 0, k - 1}], {k, 1, n}]]; b(n,k,m)=If[n == 0, 1, t[n, m]/(t[k, m]*t[n - k, m])].at n=30A156587
• A new q-combination type general triangle sequence based on Stirling first polynomials: here q=5: m=4: t(n,k)=If[m == 0, n!, Product[Sum[(-1)^(i + k)*StirlingS1[k - 1, i]*(m + 1)^i, {i, 0, k - 1}], {k, 1, n}]]; b(n,k,m)=If[n == 0, 1, t[n, m]/(t[k, m]*t[n - k, m])].at n=33A156587
• [n/2]!*[(n+1)/2]!*C([n/2],5)*C([(n+1)/2],5).at n=12A226286
• The number of permutations of 1, 2,..., n such that none of 123, 132, 213, 231, 312, 321 appear in the permutation.at n=12A269889
• a(n) = ((1+n)*floor(1+n/2))*(n!/floor(1+n/2)!)^2.at n=9A329965
• Numbers that reach 1 under the iterations of the map k -> k/d(k) if d(k) | k, and k -> k otherwise, where d(k) is the number of divisors of k (A000005).at n=25A330816
• Numbers with a record number of non-unitary square divisors.at n=28A358253
• a(n) = lcm([ n!*binomial(n-1, m-1) / m! for m = 1..n ]) with a(0) = 1.at n=10A359365