245760

Appears in sequences

• a(n) = n*2^(n-1).at n=15A001787
• a(n) = lcm(n, 2^(n-1)).at n=14A014964
• Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j)*8^j.at n=25A038214
• Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j)*8^j.at n=23A038238
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*2^j.at n=23A038280
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*4^j.at n=25A038282
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*12^j.at n=16A038290
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*8^j.at n=19A038334
• Theta series of 14-dimensional integral laminated lattice LAMBDA14.2 with minimal norm 4.at n=5A046958
• a(n) = tau(binomial(2*n,n)), where tau = number of divisors (A000005).at n=41A048784
• Triangle T(n,k) = C_n(k) where C_n(k) = number of k-colored labeled graphs with n nodes (n >= 1, 1<=k<=n).at n=19A058843
• a(n) = 2^(2*n)*(2*n+1).at n=7A058962
• a(n) is the position of A050614(n) in A062877.at n=17A062878
• Numbers k such that usigma(phi(k)) is a prime.at n=37A065875
• Maximal number of divisors of any n-digit number.at n=19A066150
• Smallest integer that can be expressed as the sum of consecutive odd numbers in exactly n ways.at n=25A068314
• Arithmetic derivative of cubes: a(n) = 3*n^2*A003415(n).at n=31A068721
• 16-almost primes (generalization of semiprimes).at n=6A069277
• Numbers of the form 5*2^n or 5*3*2^n; a(n) = 5*A029744(n).at n=30A070004
• Binary expansion is 1xx100...0 where xx = 00 or 11.at n=29A070876