|
Search: id:A028480
|
|
|
| A028480 |
|
Number of perfect matchings in graph C_{9} X P_{2n}. |
|
+0
1
|
|
| 76, 11989, 2091817, 372713728, 66750320449, 11970180565381, 2147314732677364, 385238046548443177, 69115057977256578649, 12399917664600455876068, 2224670061782262303745381
(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
|
Sequence in context: A098606 A093276 A093238 this_sequence A111682 A033521 A060716
Adjacent sequences: A028477 A028478 A028479 this_sequence A028481 A028482 A028483
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
