|
| |
|
|
A028457
|
|
Number of perfect matchings in graph P_{2} X C_{5} X P_{n}.
|
|
0
| |
|
|
11, 722, 29213, 1347920, 60155908, 2711547333, 121926974411, 5486824130234, 246868369783200, 11108030731300009, 499808090143585644, 22489082779271197033, 1011905249122931313347, 45531100591422826963680
(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: A036933 A195889 A195519 * A204974 A204701 A206646
Adjacent sequences: A028454 A028455 A028456 * A028458 A028459 A028460
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Per Hakan Lundow (phl(AT)theophys.kth.se)
|
| |
|
|
