|
| |
|
|
A033528
|
|
Number of matchings in graph P_{2} X P_{5} X P_{n}.
|
|
1
|
|
|
|
1, 228, 305184, 334056618, 376940962215, 423657524608288, 476450515130518749, 535774070372040050788, 602492787376187496898304, 677518242019979197787376936, 761886547661136372157201911987, 856760801962209647160995669509984, 963449325363457811035756544808212891
(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
|
Alois P. Heinz, Table of n, a(n) for n = 0..200
Per Hakan Lundow, Enumeration of matchings in polygraphs, 1998.
|
|
|
CROSSREFS
|
Sequence in context: A220624 A098246 A091551 * A086002 A061783 A140017
Adjacent sequences: A033525 A033526 A033527 * A033529 A033530 A033531
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Per H. Lundow
|
|
|
STATUS
|
approved
|
| |
|
|
