|
|
A028449
|
|
Number of perfect matchings in graph P_{2} X P_{5} X P_{n}.
|
|
2
|
|
|
1, 8, 450, 14320, 535229, 19114420, 692276437, 24972353440, 901990734650, 32567565264292, 1176040842289105, 42466317504553328, 1533458728878759825, 55373015618048484484, 1999515562849410856778, 72202339448101503740768, 2607220750517054436937621
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,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
|
|
|
FORMULA
|
G.f.: see link above.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|