|
| |
|
|
A028485
|
|
Number of perfect matchings in graph C_{14} X P_{n}.
|
|
0
| |
|
|
2, 845, 20172, 2289869, 97964230, 7649951296, 405583759128, 27499952912185, 1591141858520618, 101905561228130549, 6113307278736517860, 382470784319563068389, 23290532695631115845632
(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: A167448 A078169 A109555 * A034227 A145748 A141185
Adjacent sequences: A028482 A028483 A028484 * A028486 A028487 A028488
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Per Hakan Lundow (phl(AT)theophys.kth.se)
|
| |
|
|
