|
| |
|
|
A037232
|
|
Number of matchings in graph C_{3} X C_{3} X P_{n}.
|
|
0
|
|
|
|
370, 473888, 545223468, 633518934269, 735463713700160, 853881267896192137, 991358212180977707016, 1150970019455064994111456, 1336279754744865935702007958, 1551424939061435419705857645677
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,1
|
|
|
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..9.
Per Hakan Lundow, Enumeration of matchings in polygraphs, 1998.
|
|
|
CROSSREFS
|
Sequence in context: A161020 A102618 A225104 * A165330 A051182 A161362
Adjacent sequences: A037229 A037230 A037231 * A037233 A037234 A037235
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Per H. Lundow
|
|
|
STATUS
|
approved
|
| |
|
|
