19399380

Appears in sequences

• a(n) = binomial(2n,n)*n*(2n+1)/2.at n=10A051133
• Least common multiple of {b(1),...,b(n)}, where b(k) = k(k+1)(2k+1)/6 = A000330(k).at n=8A051538
• Least common multiple of {b(1),...,b(n)}, where b(k) = k(k+1)(2k+1)/6 = A000330(k).at n=9A051538
• a(n) = LCM { Catalan(0), ..., Catalan(n) }.at n=10A051575
• a(n) = LCM { Catalan(0), ..., Catalan(n) }.at n=11A051575
• Numbers k which, for some r, are r-digit maximizers of k/phi(k).at n=17A065800
• a(n) = n!/(1!*2!*3!*...*k!) where k is the largest integer such that 1!*2!*3!*...*k! divides n!.at n=19A074199
• Smallest p for which there are exactly n primitive Pythagorean triangles with perimeter p; i.e., smallest p such that A070109(p) = n.at n=6A078928
• Geometric mean of n-th row of A080504.at n=21A080506
• a(n) = A081537(n)/A081535(n), with a(2) = 1 by convention.at n=22A081538
• Twice the primorials (first definition), 2*A002110(n).at n=7A088860
• a(1) = 1; a(n) = smallest positive unpicked integer such that n-k divides evenly into a(n)*a(k) for every k, 1 <= k <= n-1.at n=22A091861
• a(n) = lcm_{k=1..n} (lcm(n,n-1,...,n-k+2,n-k+1)/lcm(1,2,...,k)).at n=21A093432
• Smallest m such that A097249(m) = n; from n=1 onwards, twice the primorials, 2*A002110(n).at n=8A097250
• Least integer "mod 2 prime signatures" k ordered by number of primitive Pythagorean triples with leg = k.at n=44A097275
• a(n) = C(n+2,2)*C(n,floor(n/2)).at n=19A107231
• Primorial inflation of n: Fully multiplicative with a(p) = p# for prime p, where x# is the primorial A034386(x).at n=37A108951
• a(n) = floor(lcm(1,2,...n)/(1+2+...+n)).at n=22A109922
• a(n) = lcm(1,2,3,...,prime(n))/(1 + 2 + ... + prime(n)).at n=7A109923
• Triangle T(n,k) = lcm(1,...,2*n+2)/((k+1)*binomial(2*k+2,k+1)).at n=46A120101