131681894400
domain: N
Appears in sequences
- a(n) = (n!)^2.at n=9A001044
- Multiply successively by 1,1,2,2,3,3,4,4,..., n >= 1, a(0) = 1.at n=18A010551
- Number of permutations of degree n with greatest sum of distances.at n=18A062870
- A092186(n)/2.at n=16A092187
- Largest squared factorial dividing n!.at n=18A105350
- Largest squared factorial dividing n!.at n=19A105350
- a(n) = permanent of an n X n matrix M of zeros and ones defined as follows: if we concatenate the rows of M to form a vector v of length n^2, v_i = 1 only if i = 1 or a multiple of 2.at n=18A110947
- Column 0 of the matrix logarithm (A111941) of triangle A111940, which shifts columns left and up under matrix inverse; these terms are the result of multiplying the element in row n by n!.at n=19A111942
- Product of the nonzero digital products of all the numbers 1 to n (a 'total digital-product factorial' in base 10).at n=18A131451
- a(n) = ((2n+1)!)^2.at n=4A134374
- List of pairs: {n*(n + 1)*(2*n + 1)/6, (n!)^2}.at n=19A154225
- Triangle of polynomial coefficients related to 3F2([1,n+1,n+1],[n+2,n+2],z).at n=28A162990
- n! / (Product{k|n} k$). Here '$' denotes the swinging factorial function (A056040).at n=19A163089
- a(n) = n!/A056040(n).at n=18A180064
- a(n) = n!/A056040(n).at n=19A180064
- a(n) = lcm(n^2, n!) / lcm(n^2, swinging_factorial(n)).at n=19A181858
- a(n) = lcm(n^2, n!) / lcm(n^2, swinging_factorial(n)).at n=20A181858
- Triangle, read by rows, where the g.f. of row n equals the sum of permutations of compositions of functions (1 + k*y*x) for k=1..n with parameter y independent of variable x, as evaluated at x=1.at n=54A277408