167089

Appears in sequences

• Number of perfect matchings in graph P_{6} X P_{n}.at n=8A028468
• Number of perfect matchings in graph P_{8} X P_{n}.at n=6A028470
• Triangle T(m,n) read by rows: number of domino tilings of the m X n grid (0 <= m <= n).at n=42A187616
• Array T(m,n) read by antidiagonals: number of domino tilings of the 2m X 2n grid (m>=0, n>=0).at n=31A187617
• Array T(m,n) read by antidiagonals: number of domino tilings of the 2m X 2n grid (m>=0, n>=0).at n=32A187617
• Triangle T(m,n) read by rows: number of domino tilings of the 2m X 2n grid (0 <= m <= n).at n=13A187618
• 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=63A251072
• 6th row of array in A099390.at n=4A256044
• Triangle read by rows: order of all-2s configuration on the n X k sandpile grid graph.at n=33A256045
• The maximal number of different domino tilings allowed by the Ferrers-Young diagram of a single partition of 2n.at n=24A304790
• Triangle read by rows: T(m, n) is the number of symmetric recurrent sandpiles on an m X n grid (m >= 0, 0 <= n <= m).at n=42A348566