27874

Appears in sequences

• a(n) = C(n+2, 2) + C(n+2, 3) + C(n+2, 4) + C(n+2, 5).at n=19A027660
• Maximum number of minimum pseudo-triangulations of n points in the plane.at n=6A063646
• Number of Catalan knight paths from (0,0) to (n,0) in the region between and on the lines y=0 and y=3. (See A096587 for the definition of Catalan knight.).at n=20A099328
• Number of reduced words of length n in the Weyl group E_7 on 7 generators and order 2903040.at n=16A162493
• Number of n X n binary arrays with all 1s connected, a path of 1s from upper left corner to lower right corner, and no 1 having more than two 1s adjacent.at n=5A163684
• Number of n X 6 binary arrays with all 1s connected, a path of 1s from upper left corner to lower right corner, and no 1 having more than two 1s adjacent.at n=5A163689
• Triangle of coefficients of polynomials u(n,x) jointly generated with A210601; see the Formula section.at n=50A210600
• Number of incongruent domino tilings of the 3 X (2n) board.at n=9A232622
• Number of partitions p of n such that (number of distinct parts of p) < max(p) - min(p).at n=39A239954
• Number of partitions lambda of n that satisfy gcd(lambda_i, n-1) = 1 for all i and for which the lattice simplex delta(lambda) is an antichain simplex.at n=51A323257
• Products k of 4 distinct primes (or tetraprimes) such that none of k-2, k-1, k+1 and k+2 is squarefree.at n=17A364766
• Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with all 1's connected, a path of 1's from upper left corner to lower right corner, and no 1 having more than two 1's adjacent.at n=60A391818