|
| |
|
|
A028487
|
|
Number of perfect matchings in graph C_{16} X P_{n}.
|
|
0
| |
|
|
2, 2209, 75272, 18241441, 1227006722, 188926707649, 16603641077888, 2122419930133441, 210276188553004802, 24741567816392584609, 2589989855253457012232, 293455063685003452121761
(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: A004908 A004813 A089981 * A073476 A051103 A005800
Adjacent sequences: A028484 A028485 A028486 * A028488 A028489 A028490
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Per Hakan Lundow (phl(AT)theophys.kth.se)
|
| |
|
|
