384384

Appears in sequences

• Triangle T(n,k) = d(n-k,n), 0 <= k <= n, where d(l,m) = Sum_{k=l..m} 2^k * binomial(2*m-2*k, m-k) * binomial(m+k, m) * binomial(k, l).at n=22A067001
• Product of terms in n-th row of triangle in A077172.at n=4A077175
• A transform of binomial(n,6).at n=8A082140
• Product of terms in n-th row of triangle in A101174.at n=4A101177
• T(n, m) = 2^m * binomial(-m, n), for 0 <= m <= n, n >= 0, triangle read by rows.at n=43A122496
• Coefficients of a polynomial representation of the integral of 1/(x^4 + 2*a*x^2 + 1)^(n+1) from x = 0 to infinity.at n=26A126936
• a(n) is found from a(n-1) by dividing by D-1 and multiplying by D, where D is the smallest number that is not a divisor of a(n-1).at n=37A133582
• a(n) = (32/2)*(n-1)*(n-2)*(n-3)*(n-4).at n=14A134175
• a(n) = A143176(n)/n.at n=44A143177
• a(n) = A000108(n)*A002605(n+1), where A000108 are the Catalan numbers.at n=7A185020
• a(n) = n*(n+2)*(n+4)*(n+6).at n=21A190577
• Semi-unitary perfect numbers: numbers k such that susigma(k) = 2k, where susigma(k) is the sum of the semi-unitary divisors of k (A322485).at n=9A322486
• Triangular array read by rows. Let P be the poset of all even sized subsets of [2n] ordered by inclusion. T(n,k) is the number of intervals in P with length k, 0<=k<=n, n>=0.at n=31A328821
• T(n,k) = Sum_{j=1..n} 2^j*binomial(2*n-2*j, n-j)*binomial(n+j, n)*binomial(j, k), triangle read by rows (n >= 0 and 0 <= k <= n).at n=26A335183
• Maximum number of ways in which a set of integer-sided squares can tile an n X 3 rectangle, up to rotations and reflections.at n=22A362261
• Triangle read by rows: T(n, k) = 2^(2*n)*JacobiP(n - k, k, -1/2 - n, -1).at n=31A380865
• a(n) = lcm({1, 2, ..., n}) * (n + 1) / n for n > 0, a(0) = 1.at n=15A387027