|
Search: id:A028460
|
|
|
| A028460 |
|
Number of perfect matchings in graph P_{3} X C_{3} X P_{2n}. |
|
+0
1
|
|
| 444, 440693, 471163403, 508635101004, 549900748355911, 594654671638397671, 643075325593489894332, 695442956730066504782459, 752075788532628446524005125, 813320598084518693275523115756
(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: A128675 A043507 A098255 this_sequence A105985 A160583 A025354
Adjacent sequences: A028457 A028458 A028459 this_sequence A028461 A028462 A028463
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
