|
| |
|
|
A033514
|
|
Number of matchings in graph P_{11} X P_{n}.
|
|
2
|
|
|
|
1, 144, 251498, 293066688, 370635224561, 461148537211748, 575975678462394151, 718704019165239462736, 897032469743945346623442, 1119528305492897225312120742, 1397239543795157686038029989037, 1743829823240164494694386437970640
(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..300
Per Hakan Lundow, Enumeration of matchings in polygraphs, 1998.
|
|
|
CROSSREFS
|
Column k=11 of A210662.
Sequence in context: A023112 A159424 A013751 * A086778 A227652 A159436
Adjacent sequences: A033511 A033512 A033513 * A033515 A033516 A033517
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Per H. Lundow
|
|
|
STATUS
|
approved
|
| |
|
|
