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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066546 Number of spanning trees in the line graph of the product of two (2 x n) grid graphs. 0
4, 5976745079881894723584, 22561207271999971793667241231967232556265564782280146786713600000000 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

MATHEMATICA

NumberOfSpanningTrees[LineGraph[GraphProduct[GridGraph[2, n], GridGraph[2, n]]]] (* First load package DiscreteMath`Combinatorica` *)

CROSSREFS

Sequence in context: A147876 A164796 A004231 * A132653 A115544 A101846

Adjacent sequences:  A066543 A066544 A066545 * A066547 A066548 A066549

KEYWORD

nonn,bref

AUTHOR

Roberto E. Martinez II (remartin(AT)fas.harvard.edu), Jan 07 2002

EXTENSIONS

Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jan 14, 2002

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 February 17 14:50 EST 2012. Contains 206050 sequences.