|
| |
|
|
A028483
|
|
Number of perfect matchings in graph C_{12} X P_{n}.
|
|
0
|
|
|
|
2, 324, 5408, 290521, 7840800, 315169009, 9973238912, 363760971876, 12182847645122, 429360628398361, 14676203195596800, 510925709066955625, 17592763058388349442, 609770922769082170404
(list;
graph;
refs;
listen;
history;
text;
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
|
Table of n, a(n) for n=1..14.
Per Hakan Lundow, Enumeration of matchings in polygraphs, 1998.
|
|
|
CROSSREFS
|
Sequence in context: A192725 A089775 A094402 * A006475 A012601 A012606
Adjacent sequences: A028480 A028481 A028482 * A028484 A028485 A028486
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Per H. Lundow
|
|
|
STATUS
|
approved
|
| |
|
|
