3870720

Appears in sequences

• Triangle read by rows: (i,j)-th entry is binomial(i,j)*3^(i-j)*8^j.at n=32A038226
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*3^j.at n=31A038281
• a(n) = (2*n+6)!!/6!!, related to A000165 (even double factorials).at n=6A051580
• a(n) = det(M) where M is an n X n matrix with M[i,j] = lcm(i,j).at n=8A060238
• Cumulative product of all divisors of 1..n.at n=7A092143
• Variant of A095236, where first two people choose payphones at the ends.at n=16A095240
• Minimal numbers having in canonical prime factorization at least one factor p^e such that e+1 is not prime, p prime and e>0.at n=23A099317
• Terms in A005179 where prime signature differs from that of corresponding term in A038547.at n=14A122813
• Triangle read by rows: T(n,k) = n!*2^k/(n-k)! (n >= 0, 0 <= k <= n).at n=51A161381
• The n-th Minkowski number divided by the n-th factorial: a(n) = A053657(n)/n!.at n=12A163176
• Triangle read by rows: T(n,m) = A094310(n,m)*A120070(n+1,m), 1 <= m <= n.at n=41A165969
• Triangle T(n,m) = coefficient of x^n in expansion of (x^2*cotan(x))^m = sum(n>=m, T(n,m) x^n * m!^2/n!^2).at n=38A199542
• a(n) = Product_{2 <= i < j <= n+1} (prime(i) + prime(j)).at n=3A203524
• Triangle by rows, generated from the odd integers and related to A000165.at n=37A208057
• Where records occur in A222084.at n=35A222089
• a(n) = 4^n*(2*n + 1)!/n!.at n=4A254619
• a(n) is the minimal product of a positive integer sequence of length n with no duplicate substrings of length greater than 1.at n=20A282164
• The number of positive integer sequences of length n with no duplicate substrings of length greater than 1 and a minimal product (= A282164(n)).at n=21A283557
• Minimum size of a main class for diagonal Latin squares of order n.at n=7A299785
• Partial products of the unitary totient function (A047994): a(n) = Product_{k=1..n} uphi(k).at n=11A321613