|
Search: id:A028458
|
|
|
| A028458 |
|
Number of perfect matchings in graph P_{2} X C_{6} X P_{n}. |
|
+0
1
|
|
| 20, 3108, 297296, 31937617, 3350337360, 353544256465, 37264079953664, 3928877032323636, 414211112701109036, 43669866502128209569, 4604058193083952217472, 485400369515158307543761
(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: A071152 A064878 A145405 this_sequence A079759 A088852 A123379
Adjacent sequences: A028455 A028456 A028457 this_sequence A028459 A028460 A028461
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
