4561920

Appears in sequences

• a(n) = coefficient of sqrt(2) in the expansion of (1 + sqrt(2) + sqrt(3))^n.at n=12A188571
• Divide integers 1..n into two sets, minimizing the difference of their products. This sequence is the smaller product.at n=15A200743
• Number of nX3 arrays of permutations of 0..n*3-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 4.at n=4A264637
• T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 4.at n=25A264638
• G.f. A(x) satisfies: (1 + A(x))^A(x) = (1 + x)^x ; this sequence gives the denominators of the coefficients of x^n in g.f. A(x).at n=12A306091
• Integers that can be written m = k*tau(k) = q*tau(q) where (k, q) is a primitive solution of this equation and tau(k) is the number of divisors of k.at n=31A338384
• a(n) = Sum_{k=0..floor(n/3)} (k+1) * 2^k * 3^(n-3*k) * binomial(k,4*(n-3*k)).at n=32A392075