436207616

Appears in sequences

• a(n) = n*2^(2*n-1).at n=13A002699
• a(n) = 13*2^n.at n=25A005029
• a(n) = lcm(n, 2^(n-1)).at n=25A014964
• a(0)=0, a(1)=1, a(n) = n*2^(n-2) for n >= 2.at n=26A057711
• Numbers whose sum of exponents is equal to the product of prime factors.at n=34A071174
• Refactorable numbers x, such that quotient x/A000005(x) equals a power of 2.at n=28A078541
• a(n) = the least number which is the average of two consecutive primes and has exactly n prime factors (counted with multiplicity).at n=24A092576
• Number of ternary Lyndon words of length n with exactly two 1's.at n=24A124720
• Binomial transform of A124625.at n=26A129952
• Row sums of triangle A134352.at n=25A134353
• 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=25A147761
• Expansion of x*(1-x)^2/( (1-2*x^2)*(1-2*x)^2).at n=25A178945
• a(n) = Sum_{k=0..floor(n/2)} k*binomial(n,k).at n=26A185251
• a(n) = Sum_{k=0..ceiling(n/2)} k*binomial(n,k).at n=26A185252
• 3-level binary fanout graph coloring a rectangular array: number of nX1 0..6 arrays where 0..6 label nodes of a graph with edges 0,1 1,3 1,4 0,2 2,5 2,6 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=26A223417
• Denominators of mass formula for connected vacuum graphs on 2n nodes for a phi^3 field theory.at n=13A226261
• Row sums of A146565.at n=29A259098
• Sum of the degrees of asymmetry of all binary words of length n.at n=26A274497
• Assuming the truth of the Collatz conjecture, let {m, f(m), f(f(m)), ..., 1} be the set where f is the Collatz function. The sequence lists the numbers m such that m/phi(m) + f(m)/phi(f(m)) + f(f(m))/phi(f(f(m))) + ... + 1/phi(1) is an integer, where phi is the Euler totient function A000010.at n=35A319385
• a(n) = Sum_{k=0..n}(k!*(n - k)!)/(floor(k/2)!*floor((n - k)/2)!)^2.at n=25A328000