|
Search: id:A028471
|
|
|
| A028471 |
|
Number of perfect matchings in graph P_{9} X P_{2n}. |
|
+0
2
|
|
| 55, 6336, 817991, 108435745, 14479521761, 1937528668711, 259423766712000, 34741645659770711, 4652799879944138561, 623139489426439754945, 83456125990631342400791, 11177167872295392172767936
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
Per Hakan Lundow, "Computation of matching polynomials and the number of 1-factors in polygraphs", Research report, No 12, 1996, Department of Math., Umea University, Sweden.
|
|
LINKS
|
Per Hakan Lundow, Enumeration of matchings in polygraphs, 1998.
|
|
CROSSREFS
|
Row 9 of array A099390.
Adjacent sequences: A028468 A028469 A028470 this_sequence A028472 A028473 A028474
Sequence in context: A116110 A060204 A114049 this_sequence A127950 A004708 A090813
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
