491400

Appears in sequences

• Products of 4 consecutive integers: a(n) = n*(n-1)*(n-2)*(n-3).at n=28A052762
• a(n) = n*(n-1)*(n-2)*(n-3) for n>=5.at n=28A052768
• a(n) = 4*n*(4*n-1)*(4*n-2)*(4*n-3).at n=7A054777
• LCM of composite numbers falling between n-th and (n+1)-st primes.at n=7A056831
• Infinitary harmonic numbers: harmonic mean of infinitary divisors is an integer.at n=29A063947
• a(n) = n * (2^n - 8).at n=15A083727
• a(n) = 18n^3 + 6n^2.at n=30A087887
• Smallest numbers having exactly n divisors d>1 such that also d+1 is a divisor.at n=21A088726
• Triangle built from first column sequences of generalized Stirling2 arrays (m+2,2)-Stirling2, m >= 0.at n=32A091543
• First column sequence of array A091746 ((6,2)-Stirling2).at n=3A091544
• Generalized Stirling2 array (6,2).at n=9A091746
• Maximal number of 165432 patterns in a permutation of 1,2,...,n.at n=32A100356
• a(n) = binomial(n+2,2)*binomial(n+6,2).at n=34A104473
• Product of all composite numbers k such that n! < k < prime(r) where prime(r-1)< n!.at n=3A109914
• Product of all composite numbers k such that n<k<prime(r) where prime(r-1)<=n, or 1 if this set of k is empty.at n=23A109915
• a(1) = 1, then LCM of consecutive composite numbers sandwiched between primes.at n=18A109920
• Magic products of 5 X 5 multiplicative magic squares.at n=10A111031
• Triangle T(n, k) = (binomial(n,2))! / (k! * abs(k+1 - binomial(n,2))!), read by rows.at n=32A123146
• a(n) = the smallest positive integer with exactly n positive "non-isolated divisors". A divisor, k, of n is non-isolated if (k-1) or (k+1) also divides n.at n=29A133996
• Numbers that can be written as (a^2-1)(b^2-1) in three or more distinct ways.at n=8A134856