|
| |
|
|
A028485
|
|
Number of perfect matchings in graph C_{14} X P_{n}.
|
|
3
|
|
|
|
1, 2, 845, 20172, 2289869, 97964230, 7649951296, 405583759128, 27499952912185, 1591141858520618, 101905561228130549, 6113307278736517860, 382470784319563068389, 23290532695631115845632, 1443134633691436850272225, 88425947348303637210263088
(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
|
| |
|
|
