|
| |
|
|
A007725
|
|
Number of spanning trees of Aztec diamonds of order n.
|
|
1
|
|
|
|
1, 4, 768, 18170880, 48466759778304, 14179455913065873408000, 449549878218740179750040371200000, 1534679662450485063038349752542766158611218432, 561985025597966566291275288056092110323394467225010519932928
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Table of n, a(n) for n=1..9.
Timothy Y. Chow, The Q-spectrum and spanning trees of tensor products of bipartite graphs, Proc. Amer. Math. Soc. 125 (1997), no. 11, 3155-3161.
D. E. Knuth, Aztec Diamonds, Checkerboard Graphs, and Spanning Trees, arXiv:math/9501234 [math.CO], 1995; J. Alg. Combinatorics 6 (1997), 253-257.
R. P. Stanley, Spanning trees of Aztec diamonds, Discrete Math. 157 (1996), 375-388 (Problem 251).
Index entries for sequences related to trees
|
|
|
CROSSREFS
|
Sequence in context: A284813 A306254 A068112 * A102195 A114766 A239623
Adjacent sequences: A007722 A007723 A007724 * A007726 A007727 A007728
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Richard Stanley
|
|
|
EXTENSIONS
|
More terms from Alois P. Heinz, Jan 20 2011
|
|
|
STATUS
|
approved
|
| |
|
|
