871255

Appears in sequences

• Number of ways of covering a 2n X 2n lattice by 2n^2 dominoes with exactly 4 horizontal (or vertical) dominoes.at n=9A038758
• Triangle read by rows: T(n,k) is the number of ways to choose a k-dimensional subspace U of an n-dimensional vector space over GF(2) and then choose a subspace of U.at n=63A302595
• Number of (binary) heaps where n is the sum of their length and the size of the element set [k].at n=17A373632