|
| |
|
|
A028479
|
|
Number of perfect matchings in graph C_{8} X P_{n}.
|
|
0
| |
|
|
2, 49, 392, 5041, 51842, 591361, 6422528, 71385601, 784792962, 8672638129, 95605150088, 1055154220849, 11638893993218, 128416422417409, 1416693454733312, 15629912636083201, 172434918695682818
(list; graph; refs; listen; history; internal format)
|
|
|
|
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: A058845 A041287 A057563 * A189389 A001568 A088067
Adjacent sequences: A028476 A028477 A028478 * A028480 A028481 A028482
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Per Hakan Lundow (phl(AT)theophys.kth.se)
|
| |
|
|
