1879048192

Appears in sequences

• a(n) = 7*4^n.at n=14A002042
• a(n) = n*2^(2*n-1).at n=14A002699
• a(n) = 7*2^n.at n=28A005009
• a(0)=0, a(1)=1, a(n) = n*2^(n-2) for n >= 2.at n=28A057711
• Fourth column of triangle A067402.at n=8A067404
• a(n) = least positive integer k satisfying Omega(k) = Omega(k+1)+Omega(k+2)....+Omega(k+n), where Omega = A001222 = number of prime factors, counting multiplicity.at n=8A076804
• a(n) = the least number which is the average of two consecutive primes and has exactly n prime factors (counted with multiplicity).at n=27A092576
• Number of ternary Lyndon words of length n with exactly two 1's.at n=26A124720
• Row sums of A125175.at n=30A125176
• Binomial transform of A124625.at n=28A129952
• Row sums of triangle A133599.at n=30A133600
• Row sums of triangle A134352.at n=27A134353
• Triangle, read by rows, where T(n,k) = 2^[n*(n-1) - k*(k-1)] * binomial(n,k) for n>=k>=0.at n=42A134484
• Binomial transform of [1, 6, 1, 6, 1, 6, ...].at n=29A135092
• a(n) = 8*a(n-2), with a(0) = 7, a(1) = 14.at n=19A135536
• 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=27A147761
• Expansion of x*(1-x)^2/( (1-2*x^2)*(1-2*x)^2).at n=27A178945
• a(n) = Sum_{k=0..floor(n/2)} k*binomial(n,k).at n=28A185251
• a(n) = Sum_{k=0..ceiling(n/2)} k*binomial(n,k).at n=28A185252
• Least number of the form 11*m-1 with exactly n prime factors, counted with multiplicity.at n=28A225210