A360062 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

1,3

LINKS

Pontus von Brömssen, Table of n, a(n) for n = 1..210 (rows m = 1..20)

EXAMPLE

Triangle begins:

m\n| 1 2 3 4

---+-----------------------------------

1 | 1

2 | 1 16

3 | 1 576 496125