116396280

Appears in sequences

• a(0)=12; thereafter a(n) = 12 times the product of the first n primes.at n=8A001041
• Numbers N in A002809 such that there is rho > 0 such that for all A > 0, A008475(A)-A008475(N) >= rho*log(A/N).at n=9A002497
• Least common multiple of {C(0,0), C(2,1), ..., C(2n,n)}.at n=10A025540
• Least common multiple of {C(0,0), C(2,1), ..., C(2n,n)}.at n=11A025540
• LCM of {C(0,0), C(1,0), ..., C(n, floor(n/2))}.at n=21A025552
• LCM of {C(0,0), C(1,0), ..., C(n, floor(n/2))}.at n=19A025552
• LCM of {C(0,0), C(1,0), ..., C(n, floor(n/2))}.at n=20A025552
• LCM of {C(0,0), C(1,0), ..., C(n, floor(n/2))}.at n=22A025552
• Least common multiple (or LCM) of first n positive triangular numbers (A000217).at n=17A025555
• Least common multiple (or LCM) of first n positive triangular numbers (A000217).at n=20A025555
• Least common multiple (or LCM) of first n positive triangular numbers (A000217).at n=19A025555
• Least common multiple (or LCM) of first n positive triangular numbers (A000217).at n=18A025555
• a(n) = LCM{1, C(n-1,1), C(n-2,2), ..., C(n-[ n/2 ],[ n/2 ])}.at n=21A025560
• a(n) = LCM{1, C(n-1,1), C(n-2,2), ..., C(n-[ n/2 ],[ n/2 ])}.at n=19A025560
• a(n) = 42*(n+1)*binomial(n+6,10).at n=10A027822
• a(n) = lcm(s(1),...,s(n)) where {s(n)} = A024619 and a(0) = 1.at n=22A056835
• a(n) = lcm(s(1),...,s(n)) where {s(n)} = A024619 and a(0) = 1.at n=21A056835
• a(n) = lcm(s(1),...,s(n)) where {s(n)} = A024619 and a(0) = 1.at n=20A056835
• a(n) = lcm(s(1),...,s(n)) where {s(n)} = A024619 and a(0) = 1.at n=19A056835
• a(n) = lcm(s(1),...,s(n)) where {s(n)} = A024619 and a(0) = 1.at n=18A056835