4191264000

Appears in sequences

• a(1) = 1, a(n+1)= a(n)*(n+1) divided by the smallest prime divisor of n+1.at n=21A076929
• a(1) = 1, a(n+1)= a(n)*(n+1) divided by the smallest prime divisor of n+1.at n=22A076929
• a(n)=smallest integer that, when divided by any integer from 1 to n, yields a member of A025487.at n=10A181814
• a(n)=smallest integer that, when divided by any integer from 1 to n, yields a member of A025487.at n=11A181814
• Triangle read by rows: T(n,k) (n>=1, 3<=k<=n+2) is the number of k-sequences of balls colored with n colors such that exactly two balls are of a color seen previously in the sequence.at n=53A281944
• a(n) = Product_{j=1..A089576(n)} p_j^e_j with e_j = floor(e_(j-1)*log(p_(j-1))/log(p_j)) where the first factor is 2^n.at n=8A347284
• a(n) = lcm([ n!*binomial(n-1, m-1) / m! for m = 1..n ]) with a(0) = 1.at n=11A359365
• Primitive terms of A363063.at n=14A363098
• Least number divisible by the first n primes whose factorization into maximal prime powers, if ordered by increasing prime divisor, then has these prime power factors in decreasing order.at n=5A363234
• E.g.f. A(x) satisfies A(x) = exp(x^3 * (1+x)^3 * A(x)).at n=11A389788