817991
domain: N
Appears in sequences
- Number of perfect matchings in graph P_{6} X P_{n}.at n=9A028468
- Number of perfect matchings (or domino tilings) in the graph P_9 X P_2n.at n=3A028471
- Triangle T(m,n) read by rows: number of domino tilings of the m X n grid (0 <= m <= n).at n=51A187616
- Number of domino tilings of the 9 X n grid with upper left corner removed iff n is odd.at n=6A189005
- Number A(n,k) of tilings of a 3k X n rectangle using 3n k-ominoes of shape I; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=75A251072
- The maximal number of different domino tilings allowed by the Ferrers-Young diagram of a single partition of 2n.at n=27A304790
- T(n,m) is the denominator of the resistance between two nodes located at the end of a side of length n of a rectangular electric network of n*m quadratic meshes in which all edges are replaced by one-ohm resistors, where T(n,m) is a square array read by descending antidiagonals.at n=41A357116