cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Table of values

n a(n)
1 1
2 1
3 16
4 1
5 576
6 496125
7 1
8 41616
9 1830420480
10 375297659043840
11 1
12 5085025
13 10361547386325
14 166557643451782840320
15 5885897714143664700439342125
16 1
17 945193536
18 144188666818560000
19 258848560805325726352932864
20 1192037309255692352595217996892160000
21 36939045170346949681155330481716034613142893328

List of values

[1, 1, 16, 1, 576, 496125, 1, 41616, 1830420480, 375297659043840, 1, 5085025, 10361547386325, 166557643451782840320, 5885897714143664700439342125, 1, 945193536, 144188666818560000, 258848560805325726352932864, 1192037309255692352595217996892160000, 36939045170346949681155330481716034613142893328]