Number of spanning trees of the graph acquired by placing a vertex in each of the n^2 cells of a triangle of size n in a triangular grid and placing edges between two vertices whenever two cells share a side.
A351888
Number of spanning trees of the graph acquired by placing a vertex in each of the n^2 cells of a triangle of size n in a triangular grid and placing edges between two vertices whenever two cells share a side.
Terms
- a(0) =1a(1) =1a(2) =6a(3) =196a(4) =33620a(5) =29805312a(6) =135418115000
External references
- oeis: A351888