8314020

Appears in sequences

• a(n) = (2n+3)! /( n! * (n+1)! ).at n=8A000911
• a(1)=1; for n >= 1, a(n+1) = lcm(a(n),n) / gcd(a(n),n).at n=19A008339
• a(n) = 5*(n+1)*binomial(n+2,10).at n=9A027783
• a(1) = 1, a(n) = lcm(n, a(n-1)) / gcd(n, a(n-1)).at n=18A077139
• Numbers with prime factorization pqrstu^2v^2.at n=26A190462
• The smallest number with n digits in its prime factorization (total count of digits of all bases and exponents).at n=12A192010
• Triangle read by rows: T(n, k) = v(n, k)*((1/v(n, k)) mod prime(k)), where v(n, k) = (Product_{j=1..n} prime(j))/prime(k), n >= 1, 1 <= k <= n.at n=31A240673
• Number of n X 3 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three no more than once.at n=4A269196
• T(n,k)=Number of nXk 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three no more than once.at n=25A269201
• Number of 5 X n 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three no more than once.at n=2A269205
• a(n) = 2^n * Sum_{k=0..n} Product_{j=1..k} (2/j)^((-1)^j).at n=19A328002