1647360

Appears in sequences

• a(n) = 2^(n-7)*binomial(n,7). Number of 7D hypercubes in an n-dimensional hypercube.at n=8A054851
• a(n) = 2^(n-1)*binomial(2*n-3, n-1).at n=8A069723
• Duplicate of A069723.at n=8A082142
• Triangle read by rows: T(n,m) = 4^m * (2*n+1)! / ( (2*n - 2*m + 1)! * (2*m)! ), row n has n+1 terms.at n=32A085840
• Coefficients of certain polynomials related to array A078740 ((3,2)-Stirling2).at n=28A091741
• T(n, m) = 2^m * binomial(-m, n), for 0 <= m <= n, n >= 0, triangle read by rows.at n=44A122496
• Inverse of number triangle A128412.at n=36A128413
• a(n) = lcm(n^2, swinging_factorial(n)).at n=16A181860
• 3-quantum transitions in systems of N>=3 spin 1/2 particles, in columns by combination indices.at n=31A213345
• 7-quantum transitions in systems of N >= 7 spin 1/2 particles, in columns by combination indices.at n=20A213349
• Regular triangle T(n,k) = binomial(2*n-2*k,n-k)*((n+1)/k)*Sum_{k=0..floor((k-1)/2)} (-1)^k*binomial(2*k,k)*binomial(n+3*k-2*k,k-2*k-1), read by rows.at n=35A306625
• 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=40A328821
• Triangle read by rows: T(n,k) is the number of oriented graphs on n labeled nodes with k arcs, n >= 0, k = 0..n*(n-1)/2.at n=34A350749
• 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=24A362261
• a(n) = 2^(n - HammingWeight(n)) * binomial(2*n, n).at n=8A371357