1280000

Appears in sequences

• Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j)*10^j.at n=24A038240
• Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*8^j.at n=24A038250
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*5^j.at n=24A038283
• Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*4^j.at n=24A038306
• a(1)=1 and for n>1, a(n) is the smallest multiple of a(n-1) which has no nonzero digit in common with a(n-1).at n=15A079838
• a(n) = (2*n+1) * (2*n)! / (sqrt(4*(n+1)*Product_{k=1..2*n+1} lcm(k, 2*n+2-k))).at n=22A082292
• a(n) = a(n-2) + a(n-3) if n == 0 (mod 3), a(n-1) + a(n-4) if n == 0 (mod 4), otherwise a(n-2) with a(0) = 0 and a(1) = a(2) = a(3) = 1.at n=60A141525
• Number of solutions to gcd(x^2 + y^2 + z^2 + t^2 + h^2, n) = 1 with x,y,z,t,h in [0,n-1].at n=19A238533
• Numbers k such that k^3 is the sum of two nonzero 4th powers.at n=25A291849
• a(n) = Product_{k=1..n} (binomial(k-1,3) + binomial(n-k,3)).at n=7A323496
• a(n) = n*(6*n^4 + 8*n^3 + 1 - (-1)^n)/16.at n=20A374709