3932160

Appears in sequences

• a(n) = binomial(n,2) * 2^(n-1).at n=16A001815
• Smallest number with 2n divisors.at n=37A003680
• 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=13A019285
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*8^j.at n=23A038286
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*8^j.at n=25A038286
• Octo-factorial numbers.at n=5A051189
• a(n) = (n+1)*2^(n+4).at n=15A059165
• Eighth column of triangle A067402.at n=4A067408
• Smallest integer that can be expressed as the sum of consecutive odd numbers in exactly n ways.at n=33A068314
• 20-almost primes (generalization of semiprimes).at n=6A069281
• Binary expansion is 1xx100...0 where xx = 00 or 11.at n=37A070876
• 8th binomial transform of (1,1,0,0,0,0,...).at n=7A081108
• Number of subsets of {1,.., n} containing at least one square.at n=21A089888
• Main diagonal of array A089944, in which the n-th row is the n-th binomial transform of the natural numbers.at n=7A089945
• a(n) = the least number which is the average of two consecutive primes and has exactly n prime factors (counted with multiplicity).at n=18A092576
• (Product of first n even numbers)/(product of first k odd numbers) where k is chosen to give the least integer.at n=9A092978
• a(n) = smallest positive number that occurs exactly n times as a difference between two positive squares.at n=33A094191
• Coefficients of polynomials S(n,x) related to Springer numbers.at n=15A098432
• Number of divisors of the n-th superior highly composite number.at n=28A098895
• a(n) = 15*2^n.at n=18A110286