login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068087 n^(2*n-2). 3
1, 4, 81, 4096, 390625, 60466176, 13841287201, 4398046511104, 1853020188851841, 1000000000000000000, 672749994932560009201, 552061438912436417593344, 542800770374370512771595361, 629983141281877223603213172736, 852226929923929274082183837890625 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Number of spanning trees in the bipartite graph K(n,n). In general the number of spanning trees in the bipartite graph K(m,n) is m^(n-1) * n^(m-1).

LINKS

Table of n, a(n) for n=1..15.

Eric Weisstein's World of Mathematics, Complete Bipartite Graph

Eric Weisstein's World of Mathematics, Spanning Tree

CROSSREFS

a(n) = A000169(n)^2.

Cf. A069996, A001787, A072590.

Sequence in context: A202831 A221251 A128911 * A090599 A133396 A158981

Adjacent sequences:  A068084 A068085 A068086 * A068088 A068089 A068090

KEYWORD

nonn

AUTHOR

Sharon Sela (sharonsela(AT)hotmail.com), May 06 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 19 17:43 EDT 2013. Contains 225436 sequences.