Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007725
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007725 Number of spanning trees of Aztec diamonds of order n. +0
1
1, 4, 768, 18170880, 48466759778304, 14179455913065873408000 (list; graph; listen)
OFFSET

1,2

REFERENCES

R. P. Stanley, Spanning trees of Aztec diamonds, Discrete Math. 157 (1996), 375-388 (Problem 251).

Chow, Timothy Y. 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, J. Alg. Combinatorics 6 (1997), 253-257.

LINKS

Index entries for sequences related to trees

CROSSREFS

Sequence in context: A053986 A128846 A068112 this_sequence A102195 A114766 A072725

Adjacent sequences: A007722 A007723 A007724 this_sequence A007726 A007727 A007728

KEYWORD

nonn

AUTHOR

R. P. Stanley [ rstan(AT)math.mit.edu ]

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research