|
| |
|
|
A028467
|
|
Number of perfect matchings in graph C_{4} X C_{4} X P_{n}.
|
|
0
| |
|
|
272, 589185, 930336768, 1545853411969, 2551276235535120, 4215052025641922305, 6962828841161217269760, 11502121570585083415761153, 19000667589592082076903397136
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
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
| Per Hakan Lundow, Enumeration of matchings in polygraphs, 1998.
|
|
|
CROSSREFS
| Sequence in context: A162009 A198289 A198595 * A203758 A028679 A043596
Adjacent sequences: A028464 A028465 A028466 * A028468 A028469 A028470
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Per Hakan Lundow (phl(AT)theophys.kth.se)
|
| |
|
|
