|
| |
|
|
A033529
|
|
Number of matchings in graph P_{2} X P_{6} X P_{n}.
|
|
0
|
|
|
|
1, 733, 4334009, 20324827981, 98618371821449, 476450515130518749, 2303329608950881340608, 11134067093100203643948181, 53821768256990554940684650505, 260172308883754886843036887611589, 1257663186848063684537091601425009561
(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 reports, No 12, 1996, Department of Mathematics, Umea University.
|
|
|
LINKS
|
Table of n, a(n) for n=0..10.
Per Hakan Lundow, Enumeration of matchings in polygraphs, 1998.
|
|
|
CROSSREFS
|
Sequence in context: A297761 A220625 A260035 * A118055 A025356 A025348
Adjacent sequences: A033526 A033527 A033528 * A033530 A033531 A033532
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Per H. Lundow
|
|
|
STATUS
|
approved
|
| |
|
|
