login

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”).

A193137
Number of spanning trees in the n X n rook graph.
0
1, 4, 11664, 34359738368, 156250000000000000000, 1602290118148446192720414467162112, 51474209353901743798532351474208319634964075249664, 6901746346790563787434755862277025452451108972170386555162524223799296, 4975485429479965133191172688112648024339045329697799688022189817696644226227176076118574759936
OFFSET
1,2
LINKS
Eric Weisstein's World of Mathematics, Rook Graph
Eric Weisstein's World of Mathematics, Spanning Tree
FORMULA
a(n) = n^(2*n-4) * (2*n)^((n-1)^2). - Sean A. Irvine, Oct 26 2023
CROSSREFS
Sequence in context: A191592 A261821 A151587 * A280545 A134368 A152840
KEYWORD
nonn
AUTHOR
Eric W. Weisstein, Jul 16 2011
EXTENSIONS
Initial term a(1)=1 added by N. J. A. Sloane, Jun 21 2017
STATUS
approved