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.
1, 1, 16, 1, 576, 496125, 1, 41616, 1830420480, 375297659043840, 1, 5085025, 10361547386325, 166557643451782840320, 5885897714143664700439342125, 1, 945193536, 144188666818560000, 258848560805325726352932864, 1192037309255692352595217996892160000, 36939045170346949681155330481716034613142893328
Offset: 1
Examples
Triangle begins: m\n| 1 2 3 4 ---+----------------------------------- 1 | 1 2 | 1 16 3 | 1 576 496125 4 | 1 41616 1830420480 375297659043840
Links
- Pontus von Brömssen, Table of n, a(n) for n = 1..210 (rows m = 1..20)