439296

Appears in sequences

• Number of points of L1 norm 2n in root system version of E_8 lattice.at n=11A010369
• Duplicate of A010369.at n=11A035880
• a(n) = 2^(n-7)*binomial(n,7). Number of 7D hypercubes in an n-dimensional hypercube.at n=7A054851
• a(n) = 2^n * (2*n)! / (n!)^2.at n=7A059304
• 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=28A067001
• Number of rooted unicursal planar maps with n edges and exactly one vertex of valency 1 (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).at n=7A069722
• Expansion of g.f. 8/(1+sqrt(1-8*x))^3.at n=7A085687
• E.g.f. BesselI(0,2*sqrt(2)*x) + BesselI(1,2*sqrt(2)*x)/sqrt(2).at n=14A098660
• Expansion of (sqrt(1-8*x^2)+8*x^2+2*x-1)/(2*x*sqrt(1-8*x^2)).at n=14A103973
• Riordan array (1, x*c(2x)), c(x) the g.f. of A000108.at n=58A110510
• Number triangle T(n,k) = 2^(n-k)*C(2*n,n-k).at n=28A128417
• 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=7A130813
• Triangle T(n, k) = Sum_{j=0..n} (2*n)!/((2*n-k-j)!*j!*k!), read by rows.at n=35A141723
• Riordan array (c(2x)^2,xc(2x)), c(x) the g.f. of A000108.at n=37A167432
• Number of (n+2)X(n+2) binary arrays avoiding patterns 001 and 101 in rows and columns.at n=5A202194
• Number of (n+2) X 8 binary arrays avoiding patterns 001 and 101 in rows and columns.at n=5A202200
• 7-quantum transitions in systems of N >= 7 spin 1/2 particles, in columns by combination indices.at n=16A213349
• Square array read by antidiagonals downwards: super Patalan numbers of order 4.at n=31A248325
• 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=35A335183
• Triangle read by rows: T(n, k) = 2^(2*n)*JacobiP(n - k, k, -1/2 - n, -1).at n=32A380865