|
Search: id:A028484
|
|
|
| A028484 |
|
Number of perfect matchings in graph C_{13} X P_{2n}. |
|
+0
1
|
|
| 521, 783511, 1380947751, 2539295042077, 4737855988840963, 8887976555024756736, 16707831453322853779391, 31432720082490305392103161, 59153025307098251197953889723
(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: A122715 A153180 A015291 this_sequence A057699 A033525 A138647
Adjacent sequences: A028481 A028482 A028483 this_sequence A028485 A028486 A028487
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
