|
Search: id:A028464
|
|
|
| A028464 |
|
Number of perfect matchings in graph C_{3} X C_{3} X P_{2n}. |
|
+0
1
|
|
| 1120, 2861029, 7537209013, 19875272280736, 52411725012875905, 138211512392292291937, 364468498187098321751584, 961115930137025304064194421, 2534495671871264129163903449317, 6683552014192354263830206528781536
(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: A145334 A032777 A032779 this_sequence A122052 A157444 A158729
Adjacent sequences: A028461 A028462 A028463 this_sequence A028465 A028466 A028467
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
