3326400

Appears in sequences

• a(n) = (3n)!/(3!n!).at n=3A001525
• Triangle of numbers where k-th row contains (ij)!/(i!j!) with i+j = k+1, 1 <= i <= k.at n=18A046792
• Triangle of numbers where k-th row contains (ij)!/(i!j!) with i+j = k+1, 1 <= i <= k.at n=17A046792
• Distinct elements of A045948.at n=13A048148
• Denominator of (1/Pi)*Integral_{0..oo} (sin x / x)^n dx.at n=11A049331
• Triangle read by rows, the Bell transform of n!*binomial(5,n) (without column 0).at n=46A049411
• (n-1)!/n or 0 if n does not divide (n-1)!.at n=11A055637
• Number of degree-n permutations of order exactly 8.at n=10A061122
• a(n) = floor(n!/sigma(n)).at n=10A062359
• Numbers k such that sigma(k) - usigma(k) > 3k.at n=18A063875
• n!/((n+1)*(n+2)*...*(n+k)) where k is largest value that gives an integer quotient.at n=10A068819
• a(1) = 1, a(n) = a(n-1) times smallest divisor of n >= n^(1/2).at n=11A072489
• Triangle read by rows in which n-th row gives all values of n!/{(p!)^a*(q!)^b*(r!)^c*...} (in increasing order) for all factorizations n = p^a*q^b*r^c*....at n=19A075377
• a(n) = numerator(n!/n^2).at n=11A092043
• Triangle read by rows: T(n,m) = number of T_0-multigraphs with n edges and m vertices(n>=2, 3<=m<=2*n).at n=38A093855
• A077175(n) / A077176(n).at n=9A100918
• A101177(n) / A101178(n).at n=9A101179
• a(1) = 1. For n >= 2, a(n) = sum of the two (not necessarily distinct) earlier terms, a(j) and a(k), which maximizes d(a(j)+a(k)), where d(m) is the number of positive divisors of m. a(n) = the maximum (a(j)+a(k)) if more than one such sum has the maximum number of divisors.at n=27A115386
• Triangle T(n,k) = n!/(k!*(n-3*k)!), for n >= 3*k >= 0, read by rows.at n=29A118394
• Smallest number m having exactly n divisors d with sqrt(m/2) <= d < sqrt(2*m).at n=34A128605