|
Search: id:A028482
|
|
|
| A028482 |
|
Number of perfect matchings in graph C_{11} X P_{2n}. |
|
+0
1
|
|
| 199, 97021, 53924597, 30946370401, 17931360207872, 10421993545062683, 6063482153051471479, 3528867741726076542167, 2053975467997173931810469, 1195557391003219846631664779
(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: A069244 A052355 A097732 this_sequence A111472 A033523 A094220
Adjacent sequences: A028479 A028480 A028481 this_sequence A028483 A028484 A028485
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
