|
|
A212800
|
|
Number of spanning trees of the (n,n)-torus grid graph.
|
|
4
|
|
|
1, 32, 11664, 42467328, 1562500000000, 587312954081280000, 2266101334892340404752384, 89927963805390785392395474173952, 36735015407753190053984060991247792275456, 154528563849617762057150663767149772800000000000000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
REFERENCES
|
G. Kreweras, Complexite et circuits Euleriens dans les sommes tensorielles de graphes, J. Combin. Theory, B 24 (1978), 202-212. See p. 210, Para. 4.
|
|
LINKS
|
|
|
FORMULA
|
a(n) ~ Gamma(1/4)^4 * exp(4*G*n^2/Pi) / (16 * Pi^3), where G is Catalan's constant A006752. - Vaclav Kotesovec, Feb 14 2021
|
|
MATHEMATICA
|
Table[n^2 * Product[4*Sin[j*Pi/n]^2 + 4*Sin[k*Pi/n]^2, {k, 1, n-1}, {j, 1, n-1}], {n, 1, 12}] // Round (* Vaclav Kotesovec, Feb 14 2021 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|