23068672

Appears in sequences

• a(n) = n*2^(2*n-1).at n=11A002699
• a(n) = 11*2^n.at n=21A005015
• a(n) = lcm(n, 2^(n-1)).at n=21A014964
• a(0)=0, a(1)=1, a(n) = n*2^(n-2) for n >= 2.at n=22A057711
• 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=21A057777
• Numbers whose sum of exponents is equal to the product of prime factors.at n=23A071174
• Refactorable numbers x, such that quotient x/A000005(x) equals a power of 2.at n=23A078541
• Number of subsets of {1,.., n} containing exactly one prime.at n=31A089821
• Number of ternary Lyndon words of length n with exactly two 1's.at n=20A124720
• Binomial transform of A124625.at n=22A129952
• Row sums of triangle A134352.at n=21A134353
• 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=21A147761
• Expansion of x*(1-x)^2/( (1-2*x^2)*(1-2*x)^2).at n=21A178945
• a(n) = Sum_{k=0..floor(n/2)} k*binomial(n,k).at n=22A185251
• a(n) = Sum_{k=0..ceiling(n/2)} k*binomial(n,k).at n=22A185252
• Sum of the degrees of asymmetry of all binary words of length n.at n=22A274497
• a(n) = Sum_{k=0..n}(k!*(n - k)!)/(floor(k/2)!*floor((n - k)/2)!)^2.at n=21A328000
• a(n) is the least number with n prime factors (counted with multiplicity) that is the concatenation of two primes.at n=21A374669