|
| |
|
|
A028465
|
|
Number of perfect matchings in graph C_{3} X C_{4} X P_{n}.
|
|
0
| |
|
|
50, 13680, 2758784, 594171481, 126820978560, 27131807289745, 5803101986080736, 1241308675434652080, 265520025152559669938, 56795817642070468777849, 12148857852574217536512768
(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: A184555 A152258 A203097 * A034205 A173170 A146518
Adjacent sequences: A028462 A028463 A028464 * A028466 A028467 A028468
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Per Hakan Lundow (phl(AT)theophys.kth.se)
|
| |
|
|
