|
Search: id:A028474
|
|
|
| A028474 |
|
Number of perfect matchings in graph P_{12} X P_{n}. |
|
+0
2
|
|
| 1, 233, 2131, 145601, 2332097, 106912793, 2188978117, 82741005829, 1937528668711, 65743732590821, 1666961188795475, 53060477521960000, 1412218550274852671, 43242613716069407953, 1185802123987680144427
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
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
|
Row 12 of array A099390.
Sequence in context: A108820 A003537 A037033 this_sequence A101218 A036209 A077803
Adjacent sequences: A028471 A028472 A028473 this_sequence A028475 A028476 A028477
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
