Triangle read by rows: T(m,n) is the number of spanning trees in the graph whose nodes are the integer lattice points (x,y) with 0 <= x < m and 0 <= y < n, and with an edge between two nodes if there is no other integer lattice point on the line segment between them; 1 <= n <= m.
A360062
Triangle read by rows: T(m,n) is the number of spanning trees in the graph whose nodes are the integer lattice points (x,y) with 0 <= x < m and 0 <= y < n, and with an edge between two nodes if there is no other integer lattice point on the line segment between them; 1 <= n <= m.
Terms
- a(0) =1a(1) =1a(2) =16a(3) =1a(4) =576a(5) =496125a(6) =1a(7) =41616a(8) =1830420480a(10) =1a(11) =5085025a(15) =1a(16) =945193536
External references
- oeis: A360062