366080

Appears in sequences

• Number of n-input 3-output switching networks under action of symmetric group S(n) on the inputs and complementing group C(3,2) on the outputs.at n=2A000842
• a(n) = 2^(n-4)*C(n,4).at n=9A003472
• Coordination sequence for diamond structure D^+_10. (Edges defined by l_1 norm = 1.)at n=9A035881
• a(0) = 0; for n >= 1, a(n) = 2^(n-1)*C(n-1), where C(n) = A000108(n) Catalan numbers, n>0.at n=9A052701
• One eighth of eighth unsigned column of Lanczos triangle A053125.at n=4A054331
• One half of tenth unsigned column of Lanczos triangle A053125 (decreasing powers).at n=3A054332
• Number of unrooted Eulerian maps with bicolored faces which are self-isomorphic under reversing the colors.at n=16A090375
• a(n) = (n+1)^2*(n+2)*(2*n+3)/6.at n=31A108678
• Maximum number of pairwise incomparable subcubes of the discrete n-cube. Largest antichain in partial ordering {0,1,*}^n where 0 and 1 are less than *. Maximum number of implicants in an irredundant disjunctive normal form for n Boolean variables.at n=13A109388
• Riordan array (1, x*c(2x)), c(x) the g.f. of A000108.at n=46A110510
• Riordan array (1/(1+2xc(-2x)),xc(-2x)/(1+2xc(-2x))), c(x) the g.f. of A000108.at n=36A114193
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0, 0), ending on the vertical axis and consisting of 2n steps taken from {(-1, -1), (-1, 0), (1, 1)}.at n=8A151374
• Number of (n+1)X8 0..1 arrays with the number of rightwards and downwards edge increases in each 2X2 subblock differing from the number in all its horizontal and vertical neighbors.at n=18A205071
• 4-quantum transitions in systems of N>=4 spin 1/2 particles, in columns by combination indices.at n=25A213346
• Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of 2/(1 + sqrt(1 - 4*k*x)).at n=63A290605
• 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=51A372868