|
Search: id:A028450
|
|
|
| A028450 |
|
Number of perfect matchings in graph P_{2} X P_{6} X P_{n}. |
|
+0
1
|
|
| 13, 1681, 112485, 9049169, 692276437, 53786626921, 4161756233501, 322462050747008, 24976513162427653, 1934824269280528177, 149878484960033943221, 11610280860482785441201
(list; graph; listen)
|
|
|
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: A066457 A166929 A079917 this_sequence A015513 A062314 A128394
Adjacent sequences: A028447 A028448 A028449 this_sequence A028451 A028452 A028453
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
