1114112

Appears in sequences

• a(n) = n*2^(n-1).at n=17A001787
• Hadamard maximal determinant problem: largest determinant of a (real) {0,1}-matrix of order n.at n=17A003432
• a(n) = lcm(n, 2^(n-1)).at n=16A014964
• a(n) = Product_{k=1..n-1} gcd(k,n).at n=33A051190
• Sums of two powers of 16.at n=19A055261
• a(n) = 2^(2*n)*(2*n+1).at n=8A058962
• a(n) = n^4*Product_{distinct primes p dividing n} (1+1/p^4).at n=31A065960
• 17-almost primes (generalization of semiprimes).at n=17A069278
• Numbers n such that the squarefree kernel of n is equal to the number of divisors of n.at n=33A070226
• Refactorable numbers x, such that quotient x/A000005(x) equals a power of 2.at n=19A078541
• Main diagonal of the table of k-almost primes (A078840): a(n) = (n+1)-st integer that is an n-almost prime.at n=17A078841
• a(n)=(-1)^(n+1)*det(M(n)) where M(n) is the n X n matrix M(i,j)=min(abs(i-j),i).at n=19A080692
• Start with the sequence [1, 1/2, 1/3, ..., 1/n]; form new sequence of n-1 terms by taking averages of successive terms; repeat until reach a single number F(n); a(n) = denominator of F(n).at n=16A090634
• Expansion of g.f. (1-4*x+5*x^2)/(1-2*x)^2.at n=18A097067
• a(n) = (n+1)*n^4.at n=16A101362
• a(n) = 17*2^n.at n=16A110287
• Column 0 of triangle A118441, which is the matrix log of triangle A118435.at n=17A118442
• Numbers k such that k and k^2 use only the digits 1, 2, 4, 5 and 8.at n=31A136990
• Binomial transform of A004526.at n=18A139756
• a(0) = 9, a(n) = 2*a(n-1) + 2^(n-1) for n > 0.at n=16A159697