219648

Appears in sequences

• a(n) = 2^n*C(n+6,6). Number of 6D hypercubes in an (n+6)-dimensional hypercube.at n=7A002409
• a(n) = n^2*binomial(2*n-2, n-1).at n=8A037966
• Eighth unsigned column of Lanczos triangle A053125 (decreasing powers).at n=3A054326
• a(n) = 2^(n-1)*binomial(2*n-3, n-1).at n=7A069723
• A transform of C(n,7).at n=7A082141
• Duplicate of A069723.at n=7A082142
• Inverse of number triangle A128412.at n=28A128413
• If X_1,...,X_n is a partition of a 2n-set X into 2-blocks then a(n) is equal to the number of 7-subsets of X containing none of X_i, (i=1,...n).at n=6A130813
• Janet periodic table of the elements and structured hexagonal diamond numbers. a(n) = A166911(2*n) + A166911(2*n+1).at n=21A167471
• a(n) = 2*a(n-1) - 10*a(n-2), with a(0) = 0, a(1) = 1.at n=12A190958
• 6-quantum transitions in systems of N >= 6 spin 1/2 particles, in columns by combination indices.at n=16A213348
• Number of (n+2) X (1+2) 0..1 arrays with no 3 x 3 subblock diagonal sum equal to the antidiagonal sum.at n=4A258674
• Number of (n+2)X(5+2) 0..1 arrays with no 3x3 subblock diagonal sum equal to the antidiagonal sum.at n=0A258678
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum equal to the antidiagonal sum.at n=10A258681
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum equal to the antidiagonal sum.at n=14A258681
• 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=27A306625
• Triangle read by rows: T(n,k) = binomial(n,k)^2 * binomial(2*(n-k), n-k).at n=37A318397
• Inverse binomial transform of A317614.at n=11A346174
• Triangle read by rows, T(n, k) = [x^k] hypergeom([1/2, -n, -n], [1, 1], 4*x).at n=43A367177
• Irregular triangle read by rows: T(n,k) is the number of flattened Catalan words of length n with exactly k runs of weak ascents, with 1 <= k <= ceiling(n/2).at n=52A372868