4768673

Appears in sequences

• Complexity of (or spanning trees in) a 3 X n grid.at n=6A006238
• Square array read by antidiagonals: T(m,n) = number of spanning trees in an m X n grid.at n=38A116469
• Square array read by antidiagonals: T(m,n) = number of spanning trees in an m X n grid.at n=42A116469
• Number of domino tilings of the 5 X n grid with upper left corner removed iff n is odd.at n=13A189003
• Number of spanning trees in the graph P_7 x P_n.at n=2A334002