96468992

Appears in sequences

• a(n) = n*2^(n-1).at n=23A001787
• a(n) = lcm(n, 2^(n-1)).at n=22A014964
• a(n) = 2^(2*n)*(2*n+1).at n=11A058962
• Refactorable numbers x, such that quotient x/A000005(x) equals a power of 2.at n=27A078541
• Main diagonal of the table of k-almost primes (A078840): a(n) = (n+1)-st integer that is an n-almost prime.at n=23A078841
• 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=22A090634
• Expansion of g.f. (1-4*x+5*x^2)/(1-2*x)^2.at n=24A097067
• Binomial transform of A004526.at n=24A139756
• a(n) is the smallest positive integer m with exactly n zeros in its binary representation and with n represented in binary as a substring of the binary representation of m.at n=22A147761
• Numbers with 46 divisors.at n=7A175753
• a(n) = sin((2*n+5)*Pi/6)*(n+1)*2^(n+1).at n=22A176900
• Number of (possibly overlapping) occurrences of the subword given by the binary expansion of n in all binary words of length n.at n=27A228612
• Expansion of x*(5+x+x^2)/(1-2*x).at n=25A248646
• E.g.f.: Sum_{n>=1} x^(n^2) * exp(2*x^n) / n!.at n=22A259223
• Least number divisible by n whose number of divisors is also divisible by n.at n=22A272348
• Numbers of the form 4^k*(8*j+7) that have exactly three partitions into four positive squares.at n=35A274642
• Numbers of the form p*2^(p-1) where p is prime.at n=8A299795
• Expansion of Sum_{n>=1} ( (2 + x^n)^n - 2^n ).at n=22A318637
• a(n) = the smallest number m such that gcd(m, tau(m)) = n where tau(k) = the number of the divisors of k (A000005).at n=45A324553
• a(n) = Sum_{d|n} 2^(d-1) * binomial(d, n/d).at n=22A338695