983040

Appears in sequences

• Smallest number with 2n divisors.at n=33A003680
• Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (2,8)-perfect numbers.at n=11A019285
• Number of primitive polynomials of degree n over GF(3).at n=15A027385
• Denominator of Bernoulli(2n,1/4).at n=4A033475
• Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j)*8^j.at n=25A038238
• Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*8^j.at n=26A038250
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*4^j.at n=23A038282
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*5^j.at n=22A038283
• Least number with exactly n divisors that are at most its square root.at n=33A038549
• a(n) = 2^(n-2)*binomial(n+1,2).at n=13A052482
• a(n) = n*2^n - 2^n = 2^n*(n-1).at n=15A058922
• Jordan function J_4(n).at n=31A059377
• Smallest integer with A002191(n) divisors, i.e., the number of divisors equals the sum of the divisors of a different number.at n=30A061072
• Products of exactly 18 primes (generalization of semiprimes).at n=6A069279
• Numbers of the form 5*2^n or 5*3*2^n; a(n) = 5*A029744(n).at n=34A070004
• Binary expansion is 1xx100...0 where xx = 00 or 11.at n=33A070876
• Smallest k > n such that there are exactly n pairs (x,y) (1 <= x <= y <= k) solutions of the equation: phi(xy)=sigma(x)+sigma(y).at n=41A071780
• Denominators in the Maclaurin series for arctan(1+x).at n=29A075554
• Smallest k such that d(phi(k)) - phi(d(k)) = -n, where d(k) = A000005(k) and phi(k) = A000010(k).at n=12A078151
• Numbers k such that phi(k) is a perfect 9th power.at n=29A078169