82575360

Appears in sequences

• Quadruple factorial numbers n!!!!: a(n) = n*a(n-4).at n=28A007662
• a(n) = 4^n * n!.at n=7A047053
• Integer part of denominators of nonzero terms in asymptotic expansion of the Riemann-Seigel Z-function.at n=12A050277
• a(n) = (4*n+8)(!^4)/8(!^4), related to A034177(n+1) ((4*n+4)(!^4) quartic, or 4-factorials).at n=6A051620
• Number of divisors of k as k runs through sequence of distinct values of LCM(1,..,n).at n=32A056795
• Least number whose number of divisors is n-th term from A014613 (numbers of form p*q*r*s, products of exactly 4 primes, counted with multiplicity).at n=29A061218
• Denominators in the series for Bessel function J6(x).at n=2A061405
• Binomial transform of decagonal numbers A001107.at n=18A086950
• Ratio of volume of n-dimensional ball to circumscribing n-cube is Pi^floor(n/2) divided by a(n).at n=14A087299
• Variant of A095236, where first two people choose payphones at the ends.at n=18A095240
• The lower left triangle of the ED1 array A167546.at n=35A167557
• The lower left triangle of the ED2 array A167560.at n=35A167569
• Triangle read by rows, k!*S_4(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0.at n=35A225473
• a(n) = 2^n * floor(n/2)!at n=14A271216
• Triangle read by rows: T(n, m) = A285061(n, m)*m!, 0 <= m <= n.at n=35A285066
• a(n) is the number of numbers whose largest prime power factor equals A000961(n).at n=33A305215
• Number of ways to choose a factorization of each integer from 2 to n into factors > 1.at n=27A321514
• Number of ways to choose a factorization of each integer from 2 to n into factors > 1.at n=28A321514
• Triangle read by rows, generalized Eulerian polynomials evaluated at x = 1.at n=32A337997
• a(n) = n! / (a(n-1) a(n-2) a(n-3)), where a(0) = a(1) = a(2) = 1.at n=28A372995