|
Search: id:A028478
|
|
|
| A028478 |
|
Number of perfect matchings in graph C_{7} X P_{2n}. |
|
+0
1
|
|
| 29, 1471, 79808, 4375897, 240378643, 13209069847, 725898384359, 39891876471539, 2192269974717929, 120476898663671488, 6620847045486150863, 363850801995789860221, 19995539171949615541457
(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: A049657 A091994 A126555 this_sequence A042627 A042624 A045688
Adjacent sequences: A028475 A028476 A028477 this_sequence A028479 A028480 A028481
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
