|
%I #9 Jan 28 2023 15:46:45
%S 1,1,16,1,576,496125,1,41616,1830420480,375297659043840,1,5085025,
%T 10361547386325,166557643451782840320,5885897714143664700439342125,1,
%U 945193536,144188666818560000,258848560805325726352932864,1192037309255692352595217996892160000,36939045170346949681155330481716034613142893328
%N 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.
%H Pontus von Brömssen, <a href="/A360062/b360062.txt">Table of n, a(n) for n = 1..210</a> (rows m = 1..20)
%e Triangle begins:
%e m\n| 1 2 3 4
%e ---+-----------------------------------
%e 1 | 1
%e 2 | 1 16
%e 3 | 1 576 496125
%e 4 | 1 41616 1830420480 375297659043840
%Y Cf. A116469, A247943, A360063.
%K nonn,tabl
%O 1,3
%A _Pontus von Brömssen_, Jan 24 2023
|
