|
| |
|
|
A028451
|
|
Number of perfect matchings in graph P_{2} X P_{7} X P_{n}.
|
|
1
| |
|
|
21, 6272, 880163, 152526845, 24972353440, 4161756233501, 690427159718433, 114725843769441312, 19056798015394695543, 3165986817537284900809, 525966380704787334395776, 87380576637559587656345353
(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: A055416 A203370 A074053 * A178327 A176446 A135823
Adjacent sequences: A028448 A028449 A028450 * A028452 A028453 A028454
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Per Hakan Lundow (phl(AT)theophys.kth.se)
|
| |
|
|
