|
Search: id:A028452
|
|
|
| A028452 |
|
Number of perfect matchings in graph P_{3} X P_{3} X P_{2n}. |
|
+0
1
|
|
| 229, 117805, 64647289, 35669566217, 19690797527709, 10870506600976757, 6001202979497804657, 3313042830624031354513, 1829008840116358153050197, 1009728374600381843221483965
(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
|
Adjacent sequences: A028449 A028450 A028451 this_sequence A028453 A028454 A028455
Sequence in context: A112847 A139512 A124684 this_sequence A072020 A122269 A051183
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
