A066546 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

Other ways to Give

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; text; internal format)

OFFSET

1,1

LINKS

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

MATHEMATICA

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

CROSSREFS

Sequence in context: A324441 A004231 A266200 * A132653 A115544 A164797

Adjacent sequences: A066543 A066544 A066545 * A066547 A066548 A066549

KEYWORD

nonn,bref

AUTHOR

Roberto E. Martinez II, Jan 07 2002

EXTENSIONS

Edited by Dean Hickerson, Jan 14, 2002

STATUS

approved