Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066546
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066546 Number of spanning trees in the line graph of the product of two (2 x n) grid graphs. +0
1
4, 5976745079881894723584, 22561207271999971793667241231967232556265564782280146786713600000000 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

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

CROSSREFS

Sequence in context: A067501 A066545 A004231 this_sequence A132653 A115544 A101846

Adjacent sequences: A066543 A066544 A066545 this_sequence 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(AT)math.ucdavis.edu), Jan 14, 2002

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 July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research