|
| |
|
|
A028459
|
|
Number of perfect matchings in graph P_{2} X C_{7} X P_{n}.
|
|
0
| |
|
|
29, 10082, 1806059, 387692373, 79727046876, 16625358222661, 3457730603494265, 720015359158627776, 149916811809805555003, 31218852023490816278025, 6501135563145633946274820, 1353847711415498081767856265
(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: A033519 A103656 A201489 * A199369 A127425 A135253
Adjacent sequences: A028456 A028457 A028458 * A028460 A028461 A028462
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Per Hakan Lundow (phl(AT)theophys.kth.se)
|
| |
|
|
