490050

Appears in sequences

• Number of ways of covering a 2n X 2n lattice by 2n^2 dominoes with exactly 4 horizontal (or vertical) dominoes.at n=8A038758
• a(n) = binomial(n+3,2)*binomial(n+4,3)*binomial(n+5,5)/12.at n=7A107916
• a(n) is the smallest number satisfying a(n)^2+1 = p(n)*q(n), p(n) < q(n) both prime, such that q(n+1)/p(n+1) < q(n)/p(n) with the initial condition q(1)/p(1) < 3/2.at n=23A261803
• a(n) = n^2*(n^2 - 1)^2/2.at n=9A288959
• Numbers m such that m^2 + 1 = p*q with p, q primes and m = (p + q)/2 - 1.at n=19A348594