3489660928

Appears in sequences

• a(n) = 13*2^n.at n=28A005029
• 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=28A057777
• a(n) = n*2^n - 2^n = 2^n*(n-1).at n=26A058922
• a(n) = tau(Fibonacci(24*2^n))/(24*2^n) where tau(x) is the number of divisors of x (A000005(x)).at n=7A074699
• a(n) is the smallest x such that the quotient d(x)/d(x+1) equals n, where d = A000005.at n=28A080372
• Row sums of A146565.at n=32A259098
• a(n) = (3*n^2 - 3*n + 8)*2^(n - 3).at n=24A300451
• a(n) = nim-product of 2^3 and 2^n.at n=31A335160