1179648

Appears in sequences

• a(n) = n*2^(2*n-1).at n=9A002699
• a(n) = 9*2^n.at n=17A005010
• Theta series of 16-dimensional 2-modular lattice with min norm 3 and det 256 (the "odd Barnes-Wall lattice").at n=10A014711
• a(n) = lcm(n, 2^(n-1)).at n=17A014964
• Numbers of form 6^i*8^j, with i, j >= 0.at n=33A025627
• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*8^j.at n=26A038262
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*6^j.at n=22A038284
• Denominators in the Taylor series for arccosh(x) - log(2*x).at n=8A052469
• Expansion of e.g.f. x^2*exp(4*x).at n=9A052780
• a(0)=0, a(1)=1, a(n) = n*2^(n-2) for n >= 2.at n=18A057711
• a(n) is the smallest number such that a(n)+1 is a prime and the largest power of 2 which divides it is 2^n.at n=17A057777
• Reciprocal of n terminates with an infinite repetition of digit 2. Multiples of 10 are omitted.at n=4A064561
• 19-almost primes (generalization of semiprimes).at n=2A069280
• Let M_n be the n X n matrix m(i,j) = min(prime(i), prime(j)); then a(n) = det(M_n).at n=13A070323
• Binary expansion is 1xx100...0 where xx = 00 or 11.at n=34A070876
• Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 0.at n=13A074406
• Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 2.at n=13A074408
• a(1)=1, then a(n)=3*a(n-1) if n is already in the sequence, a(n)=2*a(n-1) otherwise.at n=19A079352
• Let b(n) equal the product of the exponents in the prime factorization of n. Then a(n) gives the least k such that b(k) = n.at n=33A085629
• Number of subsets of {1,.., n} containing exactly one prime.at n=25A089821